Intra coded video using quantized residual differential pulse code modulation coding

ABSTRACT

Video coding and decoding methods are described. In example method includes performing a conversion between a current video block of a video and a bitstream representation of the current video block by determining a first intra coding mode to be stored which is associated with the current video block using a differential coding mode, where the first intra coding mode associated with the current video block is determined according to a second prediction mode used by the differential coding mode, and where, in the differential coding mode, a difference between a quantized residual of an intra prediction of the current video block and a prediction of the quantized residual is represented in the bitstream representation for the current video block using a differential pulse coding modulation (DPCM) representation.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Patent ApplicationNo. PCT/US2020/030684, filed on Apr. 30, 2020, which claims the priorityto and benefits of International Patent Application No.PCT/CN2019/085398, filed on May 1, 2019. All the aforementioned patentapplications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This patent document relates to video coding techniques, devices andsystems.

BACKGROUND

In spite of the advances in video compression, digital video stillaccounts for the largest bandwidth use on the internet and other digitalcommunication networks. As the number of connected user devices capableof receiving and displaying video increases, it is expected that thebandwidth demand for digital video usage will continue to grow.

SUMMARY

The present document describes various embodiments and techniques inwhich a secondary transform is used during decoding or encoding of videoor images.

In one example aspect, a video processing method includes performing aconversion between a current video block of a video and a bitstreamrepresentation of the current video block by determining a first intracoding mode to be stored which is associated with the current videoblock using a differential coding mode, where the first intra codingmode associated with the current video block is determined according toa second prediction mode used by the differential coding mode, andwhere, in the differential coding mode, a difference between a quantizedresidual of an intra prediction of the current video block and aprediction of the quantized residual is represented in the bitstreamrepresentation for the current video block using a differential pulsecoding modulation (DPCM) representation.

In another example aspect, a video processing method includesdetermining, according to a rule, an intra coding mode used by adifferential coding mode during a conversion between a current videoblock of a video and a bitstream representation of the current videoblock; and performing, based on the determining, the conversion betweenthe current video block and the bitstream representation of the currentvideo block using the differential coding mode, where, in thedifferential coding mode, a difference between a quantized residual ofan intra prediction of the current video block and a prediction of thequantized residual is represented in the bitstream representation forthe current video block using a differential pulse coding modulation(DPCM) representation, and where the prediction of the quantizedresidual is performed according to the intra coding mode.

In another example aspect, a video processing method is disclosed. Themethod includes performing a conversion between a current video blockand a bitstream representation of the current video block using adifferential coding mode and selectively using an intra prediction modebased on a coexistence rule; wherein the intra prediction mode is usedfor generating predictions for samples of the current video block; andwherein, the differential coding mode is used to represent a quantizedresidual block from the predictions of the pixels, using a differentialpulse coding modulation representation.

In another example aspect, another method of video processing isdisclosed. The method includes performing a conversion between a currentvideo block and a bitstream representation of the current video blockusing a differential coding mode in which a quantized residual blockfrom a predictions of pixels of the current video block is representedusing a differential pulse coding modulation representation; wherein afirst direction of the prediction or a second direction of thedifferential coding mode is inferable from the bitstream representation.

In yet another example aspect, another method of video processing isdisclosed. The method includes determining, based on an applicabilityrule, that a differential coding mode is applicable to a conversionbetween a current video block and a bitstream representation of thecurrent video block; and performing the conversion between a currentvideo block and a bitstream representation using the differential codingmode. Here, in the differential coding mode, a quantized residual blockfrom intra prediction of pixels of the current video block isrepresented using a differential pulse coding modulation representationperformed in a residual prediction direction that is different from ahorizontal or a vertical direction.

In yet another example aspect, another method of video processing isdisclosed. The method includes determining that a differential codingmode is applicable to a conversion between a current video block and abitstream representation of the current video block; and performing theconversion between a current video block and a bitstream representationusing an implementation rule of the differential coding mode; wherein,in the differential coding mode, a quantized residual block from intraprediction of pixels of the current video block is represented using adifferential pulse coding modulation representation performed in aresidual prediction direction that is different from a horizontal or avertical direction.

In yet another example aspect, another video processing method isdisclosed. The method includes determining that a differential codingmode used during a conversion between a current video block and abitstream representation of the current video block is same as an intracoding mode associated with the current video block and performing theconversion between a current video block and a bitstream representationusing an implementation rule of the differential coding mode.

In yet another example aspect, a video processing apparatus isdisclosed. The apparatus includes a processor configured to performan-above disclosed method.

In yet another example aspect, a computer readable medium is disclosed.The medium has code for processor-implementation of the above-describedmethods stored on it.

These, and other, aspects are described in the present document.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an illustration of Intra block copy.

FIG. 2 shows an example of a block coded in palette mode.

FIG. 3 shows an example use of palette predictor to signal paletteentries.

FIG. 4 shows examples of horizontal and vertical traverse scans.

FIG. 5 shows an example of coding of palette indices.

FIG. 6 shows an example process of affine linear weighted intraprediction (ALWIP) process.

FIG. 7 shows an example process of affine linear weighted intraprediction (ALWIP) process.

FIG. 8 shows an example process of affine linear weighted intraprediction (ALWIP) process.

FIG. 9 shows an example process of affine linear weighted intraprediction (ALWIP) process.

FIG. 10 is a block diagram of an example hardware platform forimplementing techniques described in the present document.

FIG. 11 is a flowchart for an example method of video processing.

FIG. 12 shows an example of four merge candidates.

FIG. 13 shows example pairs of merge candidates used in video coding.

FIG. 14 shows an example of 67 intra prediction modes.

FIG. 15 is a block diagram that illustrates an example video codingsystem that may utilize the techniques of this disclosure.

FIG. 16 is a block diagram illustrating an example of video encoder.

FIG. 17 is a block diagram illustrating an example of video decoder.

FIG. 18 is a block diagram showing an example video processing system inwhich various techniques disclosed herein may be implemented.

FIGS. 19 and 20 shows flowcharts for example methods of videoprocessing.

DETAILED DESCRIPTION

Section headings are used in the present document to facilitate ease ofunderstanding and do not limit the embodiments disclosed in a section toonly that section. Furthermore, while certain embodiments are describedwith reference to Versatile Video Coding or other specific video codecs,the disclosed techniques are applicable to other video codingtechnologies also. Furthermore, while some embodiments describe videocoding steps in detail, it will be understood that corresponding stepsdecoding that undo the coding will be implemented by a decoder.Furthermore, the term video processing encompasses video coding orcompression, video decoding or decompression and video transcoding inwhich video pixels are represented from one compressed format intoanother compressed format or at a different compressed bitrate.

1. Summary

This patent document is related to video coding technologies.Specifically, it is related to DPCM coding in video coding. It may beapplied to the existing video coding standard like HEVC, or the standard(Versatile Video Coding) to be finalized. It may be also applicable tofuture video coding standards or video codec.

2. Initial Discussion

Video coding standards have evolved primarily through the development ofthe well-known ITU-T and ISO/IEC standards. The ITU-T produced H.261 andH.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the twoorganizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4Advanced Video Coding (AVC) and H.265/HEVC [1] standards. Since H.262,the video coding standards are based on the hybrid video codingstructure wherein temporal prediction plus transform coding areutilized. To explore the future video coding technologies beyond HEVC,Joint Video Exploration Team (JVET) was founded by VCEG and MPEG jointlyin 2015. Since then, many new methods have been adopted by JVET and putinto the reference software named Joint Exploration Model (JEM) [3,4].In April 2018, the Joint Video Expert Team (JVET) between VCEG (Q6/16)and ISO/IEC JTC1 SC29/WG11 (MPEG) was created to work on the VVCstandard targeting at 50% bitrate reduction compared to HEVC.

The latest version of VVC draft, i.e., Versatile Video Coding (Draft 4)could be found at:phenix.it-sudparis.eu/jvet/doc_end_user/current_document.php?id=5755 Thelatest reference software of VVC, named VTM, could be found at:vcgit.hhi.fraunhofer.de/jvet/VVCSoftware_VTM/tags/VTM-4.0

2.1 Intra Block Copy

Intra block copy (IBC), a.k.a. current picture referencing, has beenadopted in HEVC Screen Content Coding extensions (HEVC-SCC) [1] and thecurrent VVC test model (VTM-4.0). IBC extends the concept of motioncompensation from inter-frame coding to intra-frame coding. Asdemonstrated in FIG. 1, the current block is predicted by a referenceblock in the same picture when IBC is applied. The samples in thereference block must have been already reconstructed before the currentblock is coded or decoded. Although IBC is not so efficient for mostcamera-captured sequences, it shows significant coding gains for screencontent. The reason is that there are lots of repeating patterns, suchas icons and text characters in a screen content picture. IBC can removethe redundancy between these repeating patterns effectively. InHEVC-SCC, an inter-coded coding unit (CU) can apply IBC if it choosesthe current picture as its reference picture. The MV is renamed as blockvector (BV) in this case, and a BV always has an integer-pixelprecision. To be compatible with main profile HEVC, the current pictureis marked as a “long-term” reference picture in the Decoded PictureBuffer (DPB). It should be noted that similarly, in multiple view/3Dvideo coding standards, the inter-view reference picture is also markedas a “long-term” reference picture.

Following a BV to find its reference block, the prediction can begenerated by copying the reference block. The residual can be got bysubtracting the reference pixels from the original signals. Thentransform and quantization can be applied as in other coding modes.

FIG. 1 is an illustration of Intra block copy.

However, when a reference block is outside of the picture, or overlapswith the current block, or outside of the reconstructed area, or outsideof the valid area restricted by some constrains, part or all pixelvalues are not defined. Basically, there are two solutions to handlesuch a problem. One is to disallow such a situation, e.g. in bitstreamconformance. The other is to apply padding for those undefined pixelvalues. The following sub-sessions describe the solutions in detail.

2.2 IBC in HEVC Screen Content Coding Extensions

In the screen content coding extensions of HEVC, when a block usescurrent picture as reference, it should guarantee that the wholereference block is within the available reconstructed area, as indicatedin the following spec text:

The variables offsetX and offsetY are derived asfollows:offsetX=(ChromaArrayType==0)?0:(mvCLX[0] & 0x7?2:0)(0-1)offsetY=(ChromaArrayType==0)?0:(mvCLX[1] & 0x7? 2:0) (0-2)

It is a requirement of bitstream conformance that when the referencepicture is the current picture, the luma motion vector mvLX shall obeythe following constraints:

-   -   When the derivation process for z-scan order block availability        as specified in clause 6.4.1 is invoked with (xCurr, yCurr) set        equal to (xCb, yCb) and the neighbouring luma location (xNbY,        yNbY) set equal to (xPb+(mvLX[0]>>2)−offsetX,        yPb+(mvLX[1]>>2)−offsetY) as inputs, the output shall be equal        to TRUE.    -   When the derivation process for z-scan order block availability        as specified in clause 6.4.1 is invoked with (xCurr, yCurr) set        equal to (xCb, yCb) and the neighbouring luma location (xNbY,        yNbY) set equal to (xPb+(mvLX[0]>>2)+nPbW−1+offsetX,        yPb+(mvLX[1]>>2)+nPbH−1+offsetY) as inputs, the output shall be        equal to TRUE.    -   One or both the following conditions shall be true:

The value of (mvLX[0]>>2)+nPbW+xB1+offsetX is less than or equal to 0.

The value of (mvLX[1]>>2)+nPbH+yB1+offsetY is less than or equal to 0.

-   -   The following condition shall be true:

(xPb+(mvLX[0]>>2)+nPbSw−1+offsetX)/CtbSizeY−xCurr/CtbSizeY<=yCurr/CtbSizeY−(yPb+(mvLX[1]>>2)+nPbSh−1+offsetY)/CtbSizeY(0-3)

Thus, the case that the reference block overlaps with the current blockor the reference block is outside of the picture will not happen. Thereis no need to pad the reference or prediction block.

2.3 IBC in VVC Test Model

In the current VVC test model, i.e. VTM-4.0 design, the whole referenceblock should be with the current coding tree unit (CTU) and does notoverlap with the current block. Thus, there is no need to pad thereference or prediction block. The IBC flag is coded as a predictionmode of the current CU. Thus, there are totally three prediction modes,MODE_INTRA, MODE_INTER and MODE_IBC for each CU.

2.3.1 IBC Merge Mode

In IBC merge mode, an index pointing to an entry in the IBC mergecandidates list is parsed from the bitstream. The construction of theIBC merge list can be summarized according to the following sequence ofsteps:

-   -   Step 1: Derivation of spatial candidates    -   Step 2: Insertion of HMVP candidates    -   Step 3: Insertion of pairwise average candidates

In the derivation of spatial merge candidates, a maximum of four mergecandidates are selected among candidates located in the positionsdepicted in FIG. 12. The order of derivation is A₁, B₁, B₀, A₀ and B₂.Position B₂ is considered only when any PU of position A₁, B₁, B₀, A₀ isnot available (e.g. because it belongs to another slice or tile) or isnot coded with IBC mode. After candidate at position A₁ is added, theinsertion of the remaining candidates is subject to a redundancy checkwhich ensures that candidates with same motion information are excludedfrom the list so that coding efficiency is improved. To reducecomputational complexity, not all possible candidate pairs areconsidered in the mentioned redundancy check. Instead only the pairslinked with an arrow in FIG. 13 are considered and a candidate is onlyadded to the list if the corresponding candidate used for redundancycheck has not the same motion information.

After insertion of the spatial candidates, if the IBC merge list size isstill smaller than the maximum IBC merge list size, IBC candidates fromHMVP table may be inserted. Redundancy check are performed wheninserting the HMVP candidates.

Finally, pairwise average candidates are inserted into the IBC mergelist.

When a reference block identified by a merge candidate is outside of thepicture, or overlaps with the current block, or outside of thereconstructed area, or outside of the valid area restricted by someconstrains, the merge candidate is called invalid merge candidate.

It is noted that invalid merge candidates may be inserted into the IBCmerge list.

2.3.2 IBC AMVP Mode

In IBC AMVP mode, an AMVP index point to an entry in the IBC AMVP listis parsed from the bitstream. The construction of the IBC AMVP list canbe summarized according to the following sequence of steps:

-   -   Step 1: Derivation of spatial candidates        -   Check A₀, A₁ until an available candidate is found.        -   Check B₀, B₁, B₂ until an available candidate is found.    -   Step 2: Insertion of HMVP candidates    -   Step 3: Insertion of zero candidates

After insertion of the spatial candidates, if the IBC AMVP list size isstill smaller than the maximum IBC AMVP list size, IBC candidates fromHMVP table may be inserted.

Finally, zero candidates are inserted into the IBC AMVP list.

2.4 Palette Mode

The basic idea behind a palette mode is that the samples in the CU arerepresented by a small set of representative colour values. This set isreferred to as the palette. It is also possible to indicate a samplethat is outside the palette by signalling an escape symbol followed by(possibly quantized) component values. This is illustrated in FIG. 2.

2.5 Palette Mode in HEVC Screen Content Coding extensions (HEVC-SCC)

In the palette mode in HEVC-SCC, a predictive way is used to code thepalette and index map.

2.5.1 Coding of the Palette Entries

For coding of the palette entries, a palette predictor is maintained.The maximum size of the palette as well as the palette predictor issignaled in the SPS. In HEVC-SCC, apalette_predictor_initializer_present_flag is introduced in the PPS.When this flag is 1, entries for initializing the palette predictor aresignalled in the bitstream. The palette predictor is initialized at thebeginning of each CTU row, each slice and each tile. Depending on thevalue of the palette_predictor_initializer_present_flag, the palettepredictor is reset to 0 or initialized using the palette predictorintializer entries signaled in the PPS. In HEVC-SCC, a palette predictorinitializer of size 0 was enabled to allow explicit disabling of thepalette predictor initialization at the PPS level.

For each entry in the palette predictor, a reuse flag is signaled toindicate whether it is part of the current palette. This is illustratedin FIG. 3 The reuse flags are sent using run-length coding of zeros.After this, the number of new palette entries are signaled usingexponential Golomb code of order 0. Finally, the component values forthe new palette entries are signaled.

2.5.2 Coding of Palette Indices

The palette indices are coded using horizontal and vertical traversescans as shown in FIG. 4. The scan order is explicitly signalled in thebitstream using the palette_transpose_flag. For the rest of thesubsection it is assumed that the scan is horizontal.

The palette indices are coded using two main palette sample modes:‘INDEX’ and ‘COPY_ABOVE’. As explained previously, the escape symbol isalso signaled as an ‘INDEX’ mode and assigned an index equal to themaximum palette size. The mode is signaled using a flag except for thetop row or when the previous mode was ‘COPY_ABOVE’. In the ‘COPY_ABOVE’mode, the palette index of the sample in the row above is copied. In the‘INDEX’ mode, the palette index is explicitly signaled. For both ‘INDEX’and ‘COPY_ABOVE’ modes, a run value is signaled which specifies thenumber of subsequent samples that are also coded using the same mode.When escape symbol is part of the run in ‘INDEX’ or ‘COPY_ABOVE’ mode,the escape component values are signaled for each escape symbol. Thecoding of palette indices is illustrated in FIG. 5.

This syntax order is accomplished as follows. First, the number of indexvalues for the CU is signaled. This is followed by signaling of theactual index values for the entire CU using truncated binary coding.Both the number of indices as well as the index values are coded inbypass mode. This groups the index-related bypass bins together. Thenthe palette sample mode (if necessary) and run are signaled in aninterleaved manner. Finally, the component escape values correspondingto the escape samples for the entire CU are grouped together and codedin bypass mode.

An additional syntax element, last_run_type_flag, is signaled aftersignaling the index values. This syntax element, in conjunction with thenumber of indices, eliminates the need to signal the run valuecorresponding to the last run in the block.

In HEVC-SCC, the palette mode is also enabled for 4:2:2, 4:2:0, andmonochrome chroma formats. The signaling of the palette entries andpalette indices is almost identical for all the chroma formats. In caseof non-monochrome formats, each palette entry consists of 3 components.For the monochrome format, each palette entry consists of a singlecomponent. For subsampled chroma directions, the chroma samples areassociated with luma sample indices that are divisible by 2. Afterreconstructing the palette indices for the CU, if a sample has only asingle component associated with it, only the first component of thepalette entry is used. The only difference in signaling is for theescape component values. For each escape sample, the number of escapecomponent values signaled may be different depending on the number ofcomponents associated with that sample.

2.6 Coefficients Coding in Transform Skip mode

In JVET-M0464 and JVET-N0280, several modifications are proposed on thecoefficients coding in transform skip (TS) mode in order to adapt theresidual coding to the statistics and signal characteristics of thetransform skip levels.

The proposed modifications are listed as follows.

No last significant scanning position: Since the residual signalreflects the spatial residual after the prediction and no energycompaction by transform is performed for TS, the higher probability fortrailing zeros or insignificant levels at the bottom right corner of thetransform block is not given anymore. Thus, last significant scanningposition signalling is omitted in this case. Instead, the first subblockto be processed is the most bottom right subblock within the transformblock

Subblock CBFs: The absence of the last significant scanning positionsignalling requires the subblock CBF signalling withcoded_sub_block_flag for TS to be modified as follows:

-   -   Due to quantization, the aforementioned sequence of        insignificance may still occur locally inside a transform block.        Thus, the last significant scanning position is removed as        described before and coded_sub_block_flag is coded for all        sub-blocks.    -   The coded_sub_block_flag for the subblock covering the DC        frequency position (top-left subblock) presents a special case.        In VVC Draft 3, the coded_sub_block_flag for this subblock is        never signaled and always inferred to be equal to 1. When the        last significant scanning position is located in another        subblock, it means that there is at least one significant level        outside the DC subblock. Consequently, the DC subblock may        contain only zero/non-significant levels although the        coded_sub_block_flag for this subblock is inferred to be equal        to 1. With the absence of the last scanning position information        in TS, the coded_sub_block_flag for each subblock is signaled.        This also includes the coded_sub_block_flag for the DC subblock        except when all other coded_sub_block_flag syntax elements are        already equal to 0. In this case, the DC coded_sub_block_flag is        inferred to be equal to 1 (inferDcSbCbf=1). Since there has to        be at least one significant level in this DC subblock, the        sig_coeff_flag syntax element for the first position at (0,0) is        not signaled and derived to be equal to 1        (inferSbDcSigCoeffFlag=1) instead if all other sig_coeff_flag        syntax elements in this DC subblock are equal to 0.    -   The context modeling for coded_sub_block_flag is changed. The        context model index is calculated as the sum of the        coded_sub_block_flag to the left and the coded_sub_block_flag        abovess the current subblock instead of and a logical        disjunction of both.

sig_coeff_flag context modelling: The local template in sig_coeff_flagcontext modeling is modified to only include the neighbor to the left(NB₀) and the neighbor above (NB₁) the current scanning position. Thecontext model offset is just the number of significant neighboringpositions sig_coeff_flag[NB₀]+sig_coeff_flag[NB₁]. Hence, the selectionof different context sets depending on the diagonal d within the currenttransform block is removed. This results in three context models and asingle context model set for coding the sig_coeff_flag flag.

abs_level_gt1_flag and par_level_flag context modelling: a singlecontext model is employed for abs_level_gt1_flag and par_level_flag.

abs_remainder coding: Although the empirical distribution of thetransform skip residual absolute levels typically still fits a Laplacianor a Geometrical distribution, there exist larger instationarities thanfor transform coefficient absolute levels. Particularly, the variancewithin a window of consecutive realization is higher for the residualabsolute levels. This motivates the following modifications of theabs_remainder syntax binarization and context modelling:

-   -   Using a higher cutoff value in the binarization, i.e., the        transition point from the coding with sig_coeff_flag,        abs_level_gt1_flag, par_level_flag, and abs_level_gt3_flag to        the Rice codes for abs_remainder, and dedicated context models        for each bin position yields higher compression efficiency.        Increasing the cutoff will result in more “greater than X”        flags, e.g. introducing abs_level_gt5_flag, abs_level_gt7_flag,        and so on until a cutoff is reached. The cutoff itself is fixed        to 5 (numGtFlags=5).    -   The template for the rice parameter derivation is modified,        i.e., only the neighbor to the left and the neighbor above the        current scanning position are considered similar to the local        template for sig_coeff_flag context modeling.

coeff_sign_flag context modelling: Due to the instationarities insidethe sequence of signs and the fact that the prediction residual is oftenbiased, the signs can be coded using context models, even when theglobal empirical distribution is almost uniformly distributed. A singlededicated context model is used for the coding of the signs and the signis parsed after sig_coeff_flag to keep all context coded bins together.

2.7 Quantized Residual Block Differential Pulse-CodeModulation(QR-BDPCM)

In JVET-M0413, a quantized residual block differential pulse-codemodulation (QR-BDPCM) is proposed to code screen contents efficiently.

The prediction directions used in QR-BDPCM can be vertical andhorizontal prediction modes. The intra prediction is done on the entireblock by sample copying in prediction direction (horizontal or verticalprediction) similar to intra prediction. The residual is quantized andthe delta between the quantized residual and its predictor (horizontalor vertical) quantized value is coded. This can be described by thefollowing: For a block of size M (rows)×N (cols), let r_(i,j), 0≤i≤M−1,0≤j≤N−1 be the prediction residual after performing intra predictionhorizontally (copying left neighbor pixel value across the the predictedblock line by line) or vertically (copying top neighbor line to eachline in the predicted block) using unfiltered samples from above or leftblock boundary samples. Let Q(r_(i,j)), 0≤i≤M−1, 0≤j≤N−1 denote thequantized version of the residual r_(i,j), where residual is differencebetween original block and the predicted block values. Then the blockDPCM is applied to the quantized residual samples, resulting in modifiedM×N array {tilde over (R)} with elements {tilde over (r)}_(i,j). Whenvertical BDPCM is signalled:

$\begin{matrix}{{\overset{˜}{r}}_{i,j} = \left\{ \begin{matrix}{{Q\left( r_{i,j} \right)},} & {{i = 0},{0 \leq j \leq \left( {N - 1} \right)}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{{({i - 1})},j} \right)}},} & {{1 \leq i \leq \left( {M - 1} \right)},{0 \leq j \leq \left( {N - 1} \right)}}\end{matrix} \right.} & \left( {2\text{-}7\text{-}1} \right)\end{matrix}$

For horizontal prediction, similar rules apply, and the residualquantized samples are obtained by

$\begin{matrix}{{{\overset{˜}{r}}_{i,j} =}\left\{ \begin{matrix}{{Q\left( r_{i,j} \right)},} & {{0 \leq i \leq \left( {M - 1} \right)},{j = 0}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{i,{({j - 1})}} \right)}},} & {{0 \leq i \leq \left( {M - 1} \right)}\ ,{1 \leq j \leq \left( {N - 1} \right)}}\end{matrix} \right.} & \left( {2\text{-}7\text{-}2} \right)\end{matrix}$

The residual quantized samples {tilde over (r)}_(i,j) are sent to thedecoder.

On the decoder side, the above calculations are reversed to produceQ(r_(i,j)), 0≤i≤M−1, 0≤j≤N−1. For vertical prediction case,

Q(r _(i,j))=Σ_(k=0) ^(i) {tilde over (r)}_(k,j),0≤i≤(M−1),0≤j≤(N−1)  (2-7-3)

For horizontal case,

Q(r _(i,j))=Σ_(k=0) ^(j) {tilde over (r)}_(i,k),0≤i≤(M−1),0≤j≤(N−1)  (2-7-4)

The inverse quantized residuals, Q⁻¹ (Q(r_(i,j))), are added to theintra block prediction values to produce the reconstructed samplevalues.

The main benefit of this scheme is that the inverse DPCM can be done onthe fly during coefficient parsing simply adding the predictor as thecoefficients are parsed or it can be performed after parsing.

The draft text changes of QR-BDPCM are shown as follows.

7.3.6.5 Coding Unit Syntax

Descriptor coding_unit( x0, y0, cbWidth, cbHeight, treeType ) {  if(tile_group_type != I | | sps_ibc_enabled_flag ) {   if( treeType !=DUAL_TREE_CHROMA )    cu_skip_flag[ x0 ][ y0 ] ae (v)   if(cu_skip_flag[ x0 ][ y0 ] = = 0 && tile_group_type != I )   pred_mode_flag ae (v)   if( ( ( tile_group_type = = I &&cu_skip_flag[ x0 ][ y0 ] = =0 ) | |    ( tile_group_type != I &&CuPredMode[ x0 ][ y0 ] != MODE_INTRA ) ) &&    sps_ibc_enabled_flag )   pred_mode_ibc_flag ae (v)  }  if( CuPredMode[ x0 ][ y0 ] = =MODE_INTRA ) {   if( pred_mode_flag = = MODE_INTRA && ( cIdx = = 0 ) &&   ( cbWidth <= 32) && ( CbHeight <= 32 )) {    bdpcm_flag[ x0 ][ y0 ]ae (v)    if( bdpcm_flag[ x0 ][ y0 ] ) {     bdpcm_dir_flag[ x0 ][ y0 ]ae (v)    }    else {   if( sps_pcm_enabled_flag &&    cbWidth >=MinIpcmCbSizeY && cbWidth <= MaxIpcmCbSizeY &&    cbHeight >=MinIpcmCbSizeY && cbHeight <= MaxIpcmCbSizeY )    pcm_flag[ x0 ][ y0 ]ae(v)   if( pcm_flag[ x0 ][ y0 ] ) {    while( !byte_aligned( ) )    pcm_alignment_zero_bit f (1)    pcm_sample( cbWidth, cbHeight,treeType)   } else {    if( treeType = = SINGLE_TREE | | treeType = =DUAL_TREE_LUMA ) {     if( ( y0 % CtbSizeY ) > 0 )     intra_luma_ref_idx[ x0 ][ y0 ] ae (v)     if (intra_luma_ref_idx[x0 ][ y0 ] = = 0 &&      ( cbWidth <= MaxTbSizeY | | cbHeight <=MaxTbSizeY ) &&      ( cbWidth * cbHeight > MinTbSizeY * MinTbSizeY ))     intra_subpartitions_mode_flag[ x0 ][ y0 ] ae (v)     if(intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 1 &&      cbWidth <=MaxTbSizeY && cbHeight <= MaxTbSizeY )     intra_subpartitions_split_flag[ x0 ][ y0 ] a e(v)     if(intra_luma_ref_idx[ x0 ][ y0 ] = = 0 &&     intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 0 )     intra_luma_mpm_flag[ x0 ][ y0 ] ae (v)     if( intra_luma_mpm_flag[x0 ][ y0 ] )      intra_luma_mpm_idx[ x0 ][ y0 ] ae (v)     else     intra_luma_mpm_remainder[ x0 ][ y0 ] ae (v)    }    }    if(treeType = = SINGLE_TREE | | treeType = = DUAL_TREE_CHROMA )    intra_chroma_pred_mode[ x0 ][ y0 ] ae (v)   }  }else if( treeType !=DUAL_TREE_CHROMA ) { /* MODE_INTER or MODE_IBC */ ... }bdpcm_flag[x0][y0] equal to 1 specifies that a bdpcm_dir_flag is presentin the coding unit including the luma coding block at the location (x0,y0)bdpcm_dir_flag[x0][y0] equal to 0 specifies that the predictiondirection to be used in a bdpcm block is horizontal, otherwise it isvertical.

8.4.2 Derivation Process for Luma Intra Prediction Mode

Input to this process are:

-   -   a luma location (xCb, yCb) specifying the top-left sample of the        current luma coding block relative to the top-left luma sample        of the current picture,    -   a variable cbWidth specifying the width of the current coding        block in luma samples,    -   a variable cbHeight specifying the height of the current coding        block in luma samples.        In this process, the luma intra prediction mode        IntraPredModeY[xCb][yCb] is derived.        Table 8-1 specifies the value for the intra prediction mode        IntraPredModeY[xCb][yCb] and the associated names.

TABLE 8-1 Specification of intra prediction mode and associated namesIntra prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2..66INTRA_ANGULAR2..INTRA_ANGULAR66 81..83 INTRA_LT_CCLM, INTRA_L_CCLM,INTRA_T_CCLM NOTE: The intra prediction modes INTRA_LT_CCLM,INTRA_L_CCLM and INTRA_T_CCLM are only applicable chroma components.IntraPredModeY[xCb][yCb] is derived by the following ordered steps:

-   -   The neighbouring locations (xNbA, yNbA) and (xNbB, yNbB) are set        equal to (xCb−1, yCb+cbHeight−1) and (xCb+cbWidth−1, yCb−1),        respectively.    -   For X being replaced by either A or B, the variables        candIntraPredModeX are derived as follows:    -   . . .    -   The variables ispDefaultMode1 and ispDefaultMode2 are defined as        follows:    -   . . .    -   The candModeList[x] with x=0 . . . 5 is derived as follows:    -   . . .    -   IntraPredModeY[xCb][yCb] is derived by applying the following        procedure:        -   If bdpcm_flag[xCb][yCb] is equal to 1, the            IntraPredModeY[xCb][yCb] is set equal to candModeList[0].        -   Otherwise if intra_luma_mpm_flag[xCb][yCb] is equal to 1,            the IntraPredModeY[xCb][yCb] is set equal to            candModeList[intra_luma_mpm_idx[xCb][yCb] ].        -   Otherwise, IntraPredModeY[xCb][yCb] is derived by applying            the following ordered steps:        -   . . .            The variable IntraPredModeY[x][y] with x=xCb . . .            xCb+cbWidth−1 and y=yCb . . . yCb+cbHeight−1 is set to be            equal to IntraPredModeY[xCb][yCb].

2.8 Matrix Based Intra Prediction (MIP)

The matrix based intra prediction is also called affine linear weightedintra prediction (ALWIP), which use a weighted matrix to derive theintra prediction signal.

2.8.1 Description of the Method

For predicting the samples of a rectangular block of width W and heightH, affine linear weighted intra prediction (ALWIP) takes one line of Hreconstructed neighbouring boundary samples left of the block and oneline of W reconstructed neighbouring boundary samples above the block asinput. If the reconstructed samples are unavailable, they are generatedas it is done in the conventional intra prediction.

The generation of the prediction signal is based on the following threesteps:

-   1. Out of the boundary samples, four samples in the case of W=H=4    and eight samples in all other cases are extracted by averaging.-   2. A matrix vector multiplication, followed by addition of an    offset, is carried out with the averaged samples as an input. The    result is a reduced prediction signal on a subsampled set of samples    in the original block.-   3. The prediction signal at the remaining positions is generated    from the prediction signal on the subsampled set by linear    interpolation which is a single step linear interpolation in each    direction.

The matrices and offset vectors needed to generate the prediction signalare taken from three sets S₀, S₁, S₂ of matrices. The set S₀ consists of18 matrices A₀ ^(i), i∈{0, . . . , 17} each of which has 16 rows and 4columns and 18 offset vectors b₀ ^(i), i∈{0, . . . , 17} each of size16. Matrices and offset vectors of that set are used for blocks of size4×4. The set S₁ consists of 10 matrices A₁ ^(i), i∈{0, . . . , 9}, eachof which has 16 rows and 8 columns and 10 offset vectors b₁ ^(i), i∈{0,. . . , 9} each of size 16. Matrices and offset vectors of that set areused for blocks of sizes 4×8, 8×4 and 8×8. Finally, the set S₂ consistsof 6 matrices A₂ ^(i), i∈{0, . . . , 5}, each of which has 64 rows and 8columns and of 6 offset vectors b₂ ^(i), i∈{0, . . . , 5} of size 64.Matrices and offset vectors of that set or parts of these matrices andoffset vectors are used for all other block-shapes.

The total number of multiplications needed in the computation of thematrix vector product is always smaller than or equal to 4·W·H. In otherwords, at most four multiplications per sample are required for theALWIP modes.

2.8.2 Averaging of the Boundary

In a first step, the input boundaries bdry^(top) and bdry^(left) arereduced to smaller boundaries bdry_(red) ^(top) and bdry_(red) ^(left).Here, bdry_(red) ^(top) and bdry_(red) ^(left) both consists of 2samples in the case of a 4×4-block and both consist of 4 samples in allother cases.

In the case of a 4×4-block, for 0≤i<2, one defines

${{bdr}{y_{red}^{top}\lbrack i\rbrack}} = {\left( {\left( {\sum\limits_{j = 0}^{1}{bdr{y^{top}\left\lbrack {{i \cdot 2} + j} \right\rbrack}}} \right) + 1} \right) ⪢ 1}$

and defines bdry_(red) ^(left) analogously.

Otherwise, if the block-width W is given as W=4·2^(k), for 0≤i<4, onedefines

${{bdr}{y_{red}^{top}\lbrack i\rbrack}} = {\left( {\left( {\sum\limits_{j = 0}^{2^{k} - 1}{bdr{y^{top}\left\lbrack {{i \cdot 2^{k}} + j} \right\rbrack}}} \right) + \left( {1 ⪡ \left( {k - 1} \right)} \right)} \right) ⪢ k}$

and defines bdry_(red) ^(left) analogously.

The two reduced boundaries bdry_(red) ^(top) and bdry_(red) ^(left) areconcatenated to a reduced boundary vector bdry_(red) which is thus ofsize four for blocks of shape 4×4 and of size eight for blocks of allother shapes. If mode refers to the ALWIP-mode, this concatenation isdefined as follows:

${bdry_{red}} = \left\{ {\begin{matrix}\left\lbrack {{bdry_{red}^{top}}\ ,{{bdr}y_{red}^{left}}} \right\rbrack & {{{for}\mspace{14mu} W} = {H = {{4\mspace{14mu}{and}\mspace{14mu}{mode}} < 18}}} \\\left\lbrack {{bdry_{red}^{left}},{{bdr}y_{red}^{top}}} \right\rbrack & {{{for}\mspace{14mu} W} = {H = {{4\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 18}}} \\\left\lbrack {{bdry_{red}^{top}}\ ,{{bdr}y_{red}^{left}}} \right\rbrack & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} = {{8\mspace{14mu}{and}\mspace{14mu}{mode}} < 10}} \\\left\lbrack {{bdry_{red}^{left}},{{bdr}y_{red}^{top}}} \right\rbrack & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} = {{8\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 10}} \\\left\lbrack {{bdry_{red}^{top}}\ ,{{bdr}y_{red}^{left}}} \right\rbrack & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > {8\mspace{14mu}{and}\mspace{14mu}{mode}} < 6} \\\left\lbrack {{bdry_{red}^{left}},{{bdr}y_{red}^{top}}} \right\rbrack & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > {8\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 6}\end{matrix}.} \right.$

Finally, for the interpolation of the subsampled prediction signal, onlarge blocks a second version of the averaged boundary is needed.Namely, if min(W, H)>8 and W≥H, one writes W=8*2^(l), and, for 0≤i<8,defines

${{bdr}{y_{redII}^{top}\lbrack i\rbrack}} = {\left( {\left( {\sum\limits_{j = 0}^{2^{l} - 1}{bdr{y^{top}\left\lbrack {{i \cdot 2^{l}} + j} \right\rbrack}}} \right) + \left( {1 ⪡ \left( {l - 1} \right)} \right)} \right) ⪢ {l.}}$

If min(W, H)>8 and H>W, one defines bdry_(red) ^(left) analogously.

2.8.3 Generation of the Reduced Prediction Signal by Matrix VectorMultiplication

Out of the reduced input vector bdry_(red) one generates a reducedprediction signal pred_(red). The latter signal is a signal on thedownsampled block of width W_(red) and height H_(red). Here, W_(red) andH_(red) are defined as:

$W_{red} = \left\{ {{\begin{matrix}4 & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} \leq 8} \\{\min\mspace{11mu}\left( {W,8} \right)} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > 8}\end{matrix}H_{red}} = \left\{ \begin{matrix}4 & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} \leq 8} \\{\min\mspace{11mu}\left( {H,8} \right)} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > 8}\end{matrix} \right.} \right.$

The reduced prediction signal pred_(red) is computed by calculating amatrix vector product and adding an offset:

pred_(red)=A·bdry_(red)+b.

Here, A is a matrix that has W_(red)·H_(red) rows and 4 columns if W=H=4and 8 columns in all other cases. b is a vector of size W_(red)·H_(red).

The matrix A and the vector b are taken from one of the sets S₀, S₁, S₂as follows. One defines an index idx=idx(W, H) as follows:

${id{x\left( {W,H} \right)}} = \left\{ {\begin{matrix}0 & {{{for}\mspace{14mu} W} = {H = 4}} \\1 & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} = 8} \\2 & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > 8}\end{matrix}.} \right.$

Moreover, one puts m as follows:

$m = \left\{ {\begin{matrix}{mode} & {{{for}\mspace{14mu} W} = {H = {{4\mspace{14mu}{and}\mspace{14mu}{mode}} < 18}}} \\{{mode} - 17} & {{{for}\mspace{14mu} W} = {H = {{4\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 18}}} \\{mode} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} = {{8\mspace{14mu}{and}\mspace{14mu}{mode}} < 10}} \\{{mode} - 9} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} = {{8\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 10}} \\{mode} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > {8\mspace{14mu}{and}\mspace{14mu}{mode}} < 6} \\{{mode} - 5} & {{{for}\mspace{14mu}\max\mspace{11mu}\left( {W,H} \right)} > {8\mspace{14mu}{and}\mspace{14mu}{mode}} \geq 6}\end{matrix}.} \right.$

Then, if idx≤1 or idx=2 and min(W, H)>4, one puts A=A_(idx) ^(m) andb=b_(idx) ^(m). In the case that idx=2 and min(W, H)=4, one lets A bethe matrix that arises by leaving out every row of A_(idx) ^(m) that, inthe case W=4, corresponds to an odd x-coordinate in the downsampledblock, or, in the case H=4, corresponds to an odd y-coordinate in thedownsampled block.

Finally, the reduced prediction signal is replaced by its transpose inthe following cases:

-   -   W=H=4 and mode≥18    -   max(W, H)=8 and mode≥10    -   max(W, H)>8 and mode≥6

The number of multiplications required for calculation of pred_(red) is4 in the case of W=H=4 since in this case A has 4 columns and 16 rows.In all other cases, A has 8 columns and W_(red)·H_(red) rows and oneimmediately verifies that in these cases 8·W_(red)·H_(red)4≤W·Hmultiplications are required, i.e. also in these cases, at most 4multiplications per sample are needed to compute pred_(red).

2.8.4 Illustration of the Entire ALWIP Process

The entire process of averaging, matrix vector multiplication and linearinterpolation is illustrated for different shapes in FIG. 6, FIG. 7,FIG. 8 and FIG. 9. Note, that the remaining shapes are treated as in oneof the depicted cases.

-   -   1. Given a 4×4 block, ALWIP takes two averages along each axis        of the boundary. The resulting four input samples enter the        matrix vector multiplication. The matrices are taken from the        set S₀. After adding an offset, this yields the 16 final        prediction samples. Linear interpolation is not necessary for        generating the prediction signal. Thus, a total of        (4·16)/(4·4)=4 multiplications per sample are performed.

FIG. 6 is an illustration of ALWIP for 4×4 blocks.

-   -   2. Given an 8×8 block, ALWIP takes four averages along each axis        of the boundary. The resulting eight input samples enter the        matrix vector multiplication. The matrices are taken from the        set S₁. This yields 16 samples on the odd positions of the        prediction block. Thus, a total of (8·16)/(8·8)=2        multiplications per sample are performed. After adding an        offset, these samples are interpolated vertically by using the        reduced top boundary. Horizontal interpolation follows by using        the original left boundary.

FIG. 7 is an illustration of ALWIP for 8×8 blocks.

-   -   3. Given an 8×4 block, ALWIP takes four averages along the        horizontal axis of the boundary and the four original boundary        values on the left boundary. The resulting eight input samples        enter the matrix vector multiplication. The matrices are taken        from the set S₁. This yields 16 samples on the odd horizontal        and each vertical positions of the prediction block. Thus, a        total of (8·16)/(8·4)=4 multiplications per sample are        performed. After adding an offset, these samples are        interpolated horizontally by using the original left boundary.

FIG. 8 is an illustration of ALWIP for 8×4 blocks

The transposed case is treated accordingly.

-   -   4. Given a 16×16 block, ALWIP takes four averages along each        axis of the boundary. The resulting eight input samples enter        the matrix vector multiplication. The matrices are taken from        the set S₂. This yields 64 samples on the odd positions of the        prediction block. Thus, a total of (8·64)/(16·16)=2        multiplications per sample are performed. After adding an        offset, these samples are interpolated vertically by using eight        averages of the top boundary. Horizontal interpolation follows        by using the original left boundary.

FIG. 9 is an illustration of ALWIP for 16×16 blocks

-   -   For larger shapes, the procedure is essentially the same and it        is easy to check that the number of multiplications per sample        is less than four.    -   For W×8 blocks with W>8, only horizontal interpolation is        necessary as the samples are given at the odd horizontal and        each vertical position. In this case, (8·64)/(W·8)=64/W        multiplications per sample are performed to calculate the        reduced prediction.    -   Finally for W×4 blocks with W>8, let A_(k) be the matrix that        arises by leaving out every row that corresponds to an odd entry        along the horizontal axis of the downsampled block. Thus, the        output size is 32 and again, only horizontal interpolation        remains to be performed. For calculation of reduced prediction,        (8·32)/(W·4)=64/W multiplications per sample are performed. For        W=16, no additional multiplications are required while, for        W>16, less than 2 multiplication per sample are needed for        linear interpolation. Thus, total number of multiplications is        less than or equal to four.    -   The transposed cases are treated accordingly.

2.8.5 Single Step Linear Interpolation

For a W×H block with max(W, H)>8, the prediction signal arises from thereduced prediction signal pred_(red) on W_(red)×H_(red) by linearinterpolation. Depending on the block shape, linear interpolation isdone in vertical, horizontal or both directions. If linear interpolationis to be applied in both directions, it is first applied in horizontaldirection if W<H and it is first applied in vertical direction, else.

Consider without loss of generality a W×H block with max(W, H)≥8 andW≥H. Then, the one-dimensional linear interpolation is performed asfollows. Without loss of generality, it suffices to describe linearinterpolation in vertical direction. First, the reduced predictionsignal is extended to the top by the boundary signal. Define thevertical upsampling factor U_(ver)=H/H_(red) and write U_(ver)=2^(u)^(ver) >1. Then, define the extended reduced prediction signal by

${{pre}{{d_{red}\lbrack x\rbrack}\left\lbrack {- 1} \right\rbrack}} = \left\{ {\begin{matrix}{{bdr}{y_{red}^{top}\lbrack x\rbrack}} & {{{for}\mspace{9mu} W} = 8} \\{{bdr}{y_{redII}^{top}\lbrack x\rbrack}} & {{{for}{\;\mspace{9mu}}W} > 8}\end{matrix}.} \right.$

Then, from this extended reduced prediction signal, the verticallylinear interpolated prediction signal is generated by

${{pre}{{d_{red}^{{ups},{ver}}\lbrack x\rbrack}\left\lbrack {{U_{ver} \cdot y} + k} \right\rbrack}} = {\left( {{\left( {U_{ver} - k - 1} \right) \cdot {{{pred}_{red}\lbrack x\rbrack}\left\lbrack {y - 1} \right\rbrack}} + {\left( {k + 1} \right) \cdot {{{pred}_{red}\lbrack x\rbrack}\lbrack y\rbrack}} + \frac{U_{ver}}{2}} \right) ⪢ u_{ver}}$

for 0≤x W_(red), 0≤y<H_(red) and 0≤k<U_(ver).bit-shift-only linear interpolation algorithm does not require anymultiplication.

2.8.6 Signalization of the Proposed Intra Prediction Modes

For each Coding Unit (CU) in intra mode, a flag indicating if an ALWIPmode is to be applied on the corresponding Prediction Unit (PU) or notis sent in the bitstream. If an ALWIP mode is to be applied, the indexpredmode of the ALWIP mode is signaled using a MPM-list with 3 MPMS.

Here, the derivation of the MPMs is performed using the intra-modes ofthe above and the left PU as follows. There are three fixed tablesmap_angular_to_alwip_(idx), idx∈{0,1,2} that assign to each conventionalintra prediction mode predmode_(Angular) an ALWIP mode

predmode_(ALWIP)=map_angular_to_alwip_(idx)[predmode_(Angular)].

For each PU of width W and height H one defines an index

idx(PU)=idx(W,H)∈{0,1,2}

that indicates from which of the three sets the ALWIP-parameters are tobe taken as in Section 1.3 above.

If the above Prediction Unit PU_(above) is available, belongs to thesame CTU as the current PU and is in intra mode, if idx(PU)=idx(PUabove) above) and if ALWIP is applied on PU_(above) with ALWIP-modepredmode_(ALWIP) ^(above), one puts

mode_(ALWIP) ^(above)=predmode_(ALWIP) ^(above).

If the above PU is available, belongs to the same CTU as the current PUand is in intra mode and if a conventional intra prediction modepredmode_(Angular) ^(above) is applied on the above PU, one puts

mode_(ALWIP) ^(above)=map_angular_to_alwip_(idx(PU) _(above)₎[predmode_(Angular) ^(above)].

In all other cases, one puts

mode_(ALWIP) ^(above)=−1

which means that this mode is unavailable. In the same way but withoutthe restriction that the left PU needs to belong to the same CTU as thecurrent PU, one derives a mode mode_(ALWIP) ^(left).

Finally, three fixed default lists list_(idx), idx ∈{0,1,2} areprovided, each of which contains three distinct ALWIP modes. Out of thedefault list list_(idx(PU)) and the modes mode_(ALWIP) ^(above) andmode_(ALWIP) ^(left), one constructs three distinct MPMs bysubstituting−1 by default values as well as eliminating repetitions.

2.8.7 Adapted MPM-List Derivation for Conventional Luma and ChromaIntra-Prediction Modes

The proposed ALWIP-modes are harmonized with the MPM-based coding of theconventional intra-prediction modes as follows. The luma and chromaMPM-list derivation processes for the conventional intra-predictionmodes uses fixed tables map_alwip_to_angular_(idx), idx ∈{0,1,2},mapping an ALWIP-mode predmode_(ALWIP) on a given PU to one of theconventional intra-prediction modes

predmode_(Angular)=map_alwip_to_angular_(idx(PU))[predmode_(ALWIP)].

For the luma MPM-list derivation, whenever a neighboring luma block isencountered which uses an ALWIP-mode predmode_(ALWIP), this block istreated as if it was using the conventional intra-prediction modepredmode_(Angular). For the chroma MPM-list derivation, whenever thecurrent luma block uses an LWIP-mode, the same mapping is used totranslate the ALWIP-mode to a conventional intra prediction mode.

2.9 Intra Mode Coding with 67 Intra Prediction Modes

To capture the arbitrary edge directions presented in natural video, thenumber of directional intra modes in VTM4 is extended from 33, as usedin HEVC, to 65. The new directional modes not in HEVC are depicted asred dotted arrows in FIG. 14, and the planar and DC modes remain thesame. These denser directional intra prediction modes apply for allblock sizes and for both luma and chroma intra predictions.

A unified 6-MPM list is proposed for intra blocks irrespective ofwhether MRL and ISP coding tools are applied or not. The MPM list isconstructed based on intra modes of the left and above neighboring blockas in VTM4.0. Suppose the mode of the left is denoted as Left and themode of the above block is denoted as Above, the unified MPM list isconstructed as follows:

-   -   When a neighboring block is not available, its intra mode is set        to Planar by default.    -   If both modes Left and Above are non-angular modes:        -   MPM list→{Planar, DC, V, H, V−4, V+4}    -   If one of modes Left and Above is angular mode, and the other is        non-angular:        -   Set a mode Max as the larger mode in Left and Above        -   MPM list→{Planar, Max, DC, Max−1, Max+1, Max−2}    -   If Left and Above are both angular and they are different:        -   Set a mode Max as the larger mode in Left and Above        -   if the difference of mode Left and Above is in the range of            2 to 62, inclusive            -   MPM list→{Planar, Left, Above, DC, Max−1, Max+1}        -   Otherwise            -   MPM list→{Planar, Left, Above, DC, Max−2, Max+2}    -   If Left and Above are both angular and they are the same:        -   MPM list→{Planar, Left, Left−1, Left+1, DC, Left−2}

7.3.6.5 Coding Unit Syntax

coding_unit( x0, y0, cbWidth, cbHeight, treeType ) { Descriptor  if(tile_group_type != I | | sps_ibc_enabled_flag ) {   if( treeType !=DUAL_TREE_CHROMA )    cu_skip_flag[ x0 ][ y0 ] ae(v)   if( cu_skip_flag[x0 ][ y0 ] = = 0 && tile_group_type != I )    pred_mode_flag ae(v)   if( ( ( tile_group_type = = I && cu_skip_flag[ x0 ][ y0 ] = =0 ) | |    ( tile_group_type != I && CuPredMode[ x0 ][ y0 ] != MODE_INTRA ) )&&     sps_ibc_enabled_flag )     pred_mode_ibc_flag ae(v)   }   if(CuPredMode[ x0 ][ y0 ] = = MODE_INTRA ) {   if(  sps_pcm_enabled_flag  &&     cbWidth >= MinIpcmCbSizeY &&cbWidth <= MaxIpcmCbSizeY &&     cbHeight >= MinIpcmCbSizeY && cbHeight<= MaxIpcmCbSizeY )    pcm_flag[ x0 ][ y0 ] ae(v)   if( pcm_flag[ x0 ][y0 ] ) {    while( !byte_aligned( ) )      pcm_alignment_zero_bit f(1)   pcm_sample( cbWidth, cbHeight, treeType)   } else {    if( treeType == SINGLE_TREE | | treeType = = DUAL_TREE_LUMA ) {     if( ( y0 %CtbSizeY ) > 0 )      intra_luma_ref_idx[ x0 ][ y0 ] ae(v)     if(intra_luma_ref_idx[ x0 ][ y0 ] = = 0 &&      ( cbWidth <= MaxTbSizeY || cbHeight <= MaxTbSizeY ) &&      ( cbWidth * cbHeight > MinTbSizeY *MinTbSizeY ))      intra_subpartitions_mode_flag[ x0 ][ y0 ] ae(v)    if( intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 1 &&      cbWidth<= MaxTbSizeY && cbHeight <= MaxTbSizeY )     intra_subpartitions_split_flag[ x0 ][ y0 ] ae(v)     if(intra_luma_ref_idx[ x0 ][ y0 ] = = 0 &&     intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 0 )     intra_luma_mpm_flag[ x0 ][ y0 ] ae(v)     if( intra_luma_mpm_flag[x0 ][ y0 ] ) {      if( intra_luma_ref_idx[ x0 ][ y0 ] = = 0 )      intra_luma_not_planar_flag[ x0 ][ y0 ] ae(v)      if(intra_luma_not_planar_flag[ x0 ][ y0 ] )       intra_luma_mpm_idx[ x0 ][y0 ] ae(v)     } else      intra_luma_mpm_remainded[ x0 ][ y0 ] ae(v)   }    if( treeType = = SINGLE_TREE | | treeType = = DUAL_TREE_CHROMA )    intra_chroma_pred_mode[ x0 ][ y0 ] ae(v)   }  } else if( treeType !=DUAL_TREE_CHROMA ) { /* MODE_INTER or MODE_IBC */ . . .  }  if(!pcm_flag[ x0 ][ y0 ] ) {   if( CuPredMode[ x0 ][ y0 ] != MODE_INTRA &&merge_flag[ x0 ][ y0 ] = = 0 )    cu_cbf ae(v)   if( cu_cbf ) {    if(CuPredMode[ x0 ][ y0 ] = = MODE_INTER && sps_sbt_enabled_flag &&    !ciip_flag[ x0 ][ y0 ] ) {     if( cbWidth <= MaxSbtSize && cbHeight<= MaxSbtSize ) {      allowSbtVerH = cbWidth >= 8      allowSbtVerQ =cbWidth >= 16      allowSbtHorH = cbHeight >= 8      allowSbtHorQ =cbHeight >= 16      if( allowSbtVerH | | allowSbtHorH | | allowSbtVerQ || allowSbtHorQ )       cu_sbt_flag ae(v)     }     if( cu_sbt_flag ) {     if( ( allowSbtVerH | | allowSbtHorH ) && ( allowSbtVerQ | |allowSbtHorQ) )       cu_sbt_quad_flag ae(v)      if( ( cu_sbt_quad_flag&& allowSbtVerQ && allowSbtHorQ ) | |        ( !cu_sbt_quad_flag &&allowSbtVerH && allowSbtHorH ) )       cu_sbt_horizontal_flag ae(v)     cu_sbt_pos_flag ae(v)     }    }    transform_tree( x0, y0,cbWidth, cbHeight, treeType )   }  } }The syntax elements intra_juma_mpm_flag[x0][y0],intra_juma_not_planar_flag[x0][y0], intra_juma_mpm_idx[x0][y0] andintra_juma_mpm_remainded[x0][y0] specify the intra prediction mode forluma samples. The array indices x0, y0 specify the location (x0, y0) ofthe top-left luma sample of the considered coding block relative to thetop-left luma sample of the picture. When intra_luma_mpm_flag[x0][y0] isequal to 1, the intra prediction mode is inferred from a neighbouringintra-predicted coding unit according to clause 8.4.2.When intra_luma_mpm_flag[x0][y0] is not present, it is inferred to beequal to 1.When intra_luma_not_planar_flag[x0][y0] is not present, it is inferredto be equal to 1.

2.10 Chroma Intra Mode Coding

For chroma intra mode coding, a total of 8 intra modes are allowed forchroma intra mode coding. Those modes include five traditional intramodes and three cross-component linear model modes. Chroma DM mode usethe corresponding luma intra prediction mode. Since separate blockpartitioning structure for luma and chroma components is enabled in Islices, one chroma block may correspond to multiple luma blocks.Therefore, for Chroma DM mode, the intra prediction mode of thecorresponding luma block covering the center position of the currentchroma block is directly inherited.

3. Examples of Technical Problems Solved by Disclosed Embodiments

Although the QR-BDPCM can achieve coding benefits on screen contentcoding, it may still have some drawbacks.

-   -   1. The prediction in the QR-BDPCM mode is only limited to        horizontal and vertical intra predictions, which may limit the        prediction efficiency in the QR-BDPCM mode.    -   2. The intra prediction mode is signaled for QR-BDPCM coded        blocks which may increase the rate cost of the QR-BDPCM mode    -   3. The neighboring information is not considered when mapping        the signaled message to the prediction modes in the QR-BDPCM        mode    -   4. The QR-BDPCM represents the residue by only supporting        horizontal DPCM and vertical DPCM, which may comprise the coding        performance on complex residual block    -   5. The residual range in the QR-BDPCM may exceed the maximal        range of other non QR-BDPCM modes    -   6. The QR-BDPCM does not consider the block shape    -   7. How to handle chroma when the luma block is coded with        QR-BDPCM is unknown.    -   8. The QR-BDPCM only use the first MPM mode as the stored intra        mode, which may limit the coding efficiency of intra modes.

4. Example Embodiments and Techniques

-   -   The listing of items below should be considered as examples to        explain general concepts. These inventions should not be        interpreted in a narrow way. Furthermore, these inventions can        be combined in any manner.    -   1. Sample prediction in the QR-BDPCM coded blocks may be        generated by the matrix based intra prediction (MIP) method.        -   a. In one example, when QR-BDPCM and MIP are both enabled            for one block, it is restricted that only partial of allowed            modes in MIP are supported.            -   i. In one example, the partial of allowed modes may                include those modes associated with the matrix based                intra prediction method that could be mapped to                horizontal and/or vertical normal intra mode.            -   ii. In one example, the partial of allowed modes may                only include those modes associated with the matrix                based intra prediction method that could be mapped to                horizontal and/or vertical normal intra mode.        -   b. In one example, when QR-BDPCM and MIP are both enabled            for one block, all of allowed modes in MIP are supported.    -   2. Sample prediction in the QR-BDPCM coded blocks may be        generated by intra prediction modes other than        vertical/horizontal intra predictions.        -   a. In one example, the samples in the QR-BDPCM coded blocks            may be predicted by an intra prediction mode K            -   i. In one example, K may be PLANAR mode            -   ii. In one example, K may be DC mode            -   iii. In one example, K may be HORIZONTAL mode            -   iv. In one example, K may be VERTICAL mode            -   v. In one example, K may be one candidate in the list of                most probable modes.            -   vi. In one example, K may be signaled in the bitstream        -   b. The allowed intra prediction modes for QR-BDPCM may be            based on            -   i. A message signalled in the SPS/VPS/PPS/picture                header/slice header/tile group header/LCU row/group of                LCUs            -   ii. Block dimension of current block and/or its                neighboring blocks            -   iii. Block shape of current block and/or its neighboring                blocks            -   iv. Prediction modes (Intra/Inter) of the neighboring                blocks of the current block            -   v. Intra prediction modes of the neighboring blocks of                the current block            -   vi. The indication of QR-BDPCM modes of the neighboring                block of the current block            -   vii. Current quantization parameter of current block                and/or that of its neighboring blocks            -   viii. Indication of the color format (such as 4:2:0,                4:4:4)            -   ix. Separate/dual coding tree structure            -   x. Slice/tile group type and/or picture type    -   3. Sample prediction in the QR-BDPCM coded blocks may be        generated by non-adjacent samples.        -   a. In one example, for the IBC merge mode, QR-BDPCM may be            also enabled.        -   b. In one example, for the IBC AMVP mode, QR-BDPCM may be            also enabled.        -   c. The block vector used in the IBC and QR-BDPCM may be            signaled or derived or pre-defined.            -   i. In one example, the IBC mode may be indicated by a                motion vector (block vector) and/or a merge index.            -   ii. In one example, the IBC mode may be indicated by a                default motion vector.                -   1. In one example, the default motion vector may be                    (−w,0), where w is a positive integer number                -   2. In one example, the default motion vector may be                    (0, −h), where h is a positive integer number                -   3. In one example, the default motion vector may be                    (−w, −h), where w and h are two positive integer                    numbers            -   iii. In one example, the indication of a motion vector                used in the IBC and QP-BPDCM coded blocks may be based                on:                -   1. A message signalled in the SPS/VPS/PPS/picture                    header/slice header/tile group header/LCU row/group                    of LCUs                -   2. Block dimension of current block and/or its                    neighboring blocks                -   3. Block shape of current block and/or its                    neighboring blocks                -   4. Prediction modes (Intra/Inter) of the neighboring                    blocks of the current block                -   5. Motion vectors of the neighboring blocks of the                    current block                -   6. The indication of QR-BDPCM modes of the                    neighboring block of the current block                -   7. Current quantization parameter of current block                    and/or that of its neighboring blocks                -   8. Indication of the color format (such as 4:2:0,                    4:4:4)                -   9. Separate/dual coding tree structure                -   10. Slice/tile group type and/or picture type        -   d. In one example, the sample prediction in the QR-BDPCM            mode may be generated by Inter prediction tools (e.g. affine            mode, merge mode and inter mode)    -   4. The indication of the quantized residual prediction direction        in the QR-BDPCM may be derived on-the-fly.        -   a. In one example, the indication of the quantized residual            prediction direction in the QR-BDPCM may be inferred based            on the indication of current intra prediction mode            -   i. In one example, the direction of quantized residual                prediction in the QR-BDPCM may be inferred to vertical                when the intra prediction mode is vertical            -   ii. In one example, the direction of quantized residual                prediction in the QR-BDPCM may be inferred to horizontal                when the intra prediction mode is horizontal            -   iii. In one example, the direction of quantized residual                prediction in the QR-BDPCM may be inferred to vertical                when the intra prediction mode is horizontal            -   iv. In one example, the direction of quantized residual                prediction in the QR-BDPCM may be inferred to horizontal                when the intra prediction mode is vertical        -   b. In one example, the indication of the quantized residual            prediction direction in the QR-BDPCM may be based on            -   i. A message signalled in the SPS/VPS/PPS/picture                header/slice header/tile group header/LCU row/group of                LCUs            -   ii. Block dimension of current block and/or its                neighboring blocks            -   iii. Block shape of current block and/or its neighboring                blocks            -   iv. The most probable modes of the current block and/or                its neighboring blocks            -   v. Prediction modes (Intra/Inter) of the neighboring                blocks of the current block            -   vi. Intra prediction modes of the neighboring blocks of                the current block            -   vii. Motion vectors of the neighboring blocks of the                current block            -   viii. The indication of QR-BDPCM modes of the                neighboring block of the current block            -   ix. Current quantization parameter of current block                and/or that of its neighboring blocks            -   x. Indication of the color format (such as 4:2:0, 4:4:4)            -   xi. Separate/dual coding tree structure            -   xii. Transform type applied to the current block            -   xiii. Slice/tile group type and/or picture type    -   5. The intra mode of a QR-BDPCM-coded block to be stored may be        aligned with the intra prediction mode used in the intra        prediction process.        -   a. In one example, the intra mode of a QR-BDPCM-coded block            to be stored may be inferred to the vertical mode when the            QR-BDPCM employs the vertical intra prediction (e.g.,            bdpcm_dir_flag of the current block is 1).        -   b. In one example, the intra mode of a QR-BDPCM-coded block            to be stored may be inferred to the horizontal mode when the            QR-BDPCM employs the horizontal intra prediction (e.g.,            bdpcm_dir_flag of the current block is 0).        -   c. In one example, the intra mode of a QR-BDPCM-coded block            to be stored may be inferred to the top-left mode (e.g.,            Mode 34 in VVC) when the QR-BDPCM employs the top-left intra            prediction direction.        -   d. In one example, the intra mode of a QR-BDPCM-coded block            to be stored may be inferred to the mode when is employed in            the intra prediction process in the QR-BDPCM mode.        -   e. In one example, the intra mode of a QR-BDPCM-coded block            to be stored may be inferred to the mode when is employed in            the residual prediction process in the QR-BDPCM mode.        -   f. In one example, the intra mode of the blocks coded in the            QR-BDPCM may be inferred to one mode in Most Probable Modes            (MPM) list.        -   g. In one example, the intra mode of the blocks coded in the            QR-BDPCM may inferred to a pre-defined mode.            -   i. In one example, the pre-defined mode may be                -   1. Planar mode                -   2. DC mode                -   3. Vertical mode                -   4. Horizontal mode        -   h. In one example, the intra mode of a block coded in the            QR-BDPCM mode may be determined based on            -   i. Color component            -   ii. A message signalled in the SPS/VPS/PPS/picture                header/slice header/tile group header/LCU row/group of                LCUs            -   iii. bdpcm_dir_flag            -   iv. bdpcm_flag            -   ii. Block dimension of current block and/or its                neighboring blocks            -   iii. Block shape of current block and/or its neighboring                blocks            -   iv. The most probable modes of the current block and/or                its neighboring blocks            -   v. Prediction modes (Intra/Inter) of the neighboring                blocks of the current block            -   vi. Intra prediction modes of the neighboring blocks of                the current block            -   vii. Motion vectors of the neighboring blocks of the                current block            -   viii. The indication of QR-BDPCM modes of the                neighboring block of the current block            -   ix. Current quantization parameter of current block                and/or that of its neighboring blocks            -   x. Indication of the color format (such as 4:2:0, 4:4:4)            -   xi. Coding tree structure            -   xii. Transform type applied to the current block            -   xiii. Slice/tile group type and/or picture type        -   i. In one example, the stored intra prediction mode may be            utilized for coding the following blocks, such as for the            MPM list construction of the following blocks to be coded.    -   6. The mapping from a signaled index in the QR-BDPCM to the        intra prediction mode in the QR-BDPCM mode may be based on        -   a. A message signalled in the SPS/VPS/PPS/picture            header/slice header/tile group header/LCU row/group of LCUs        -   b. Block dimension of current block and/or its neighboring            blocks        -   c. Block shape of current block and/or its neighboring            blocks        -   d. The most probable modes of the current block and/or its            neighboring blocks        -   e. Prediction modes (Intra/Inter) of the neighboring blocks            of the current block        -   f. Intra prediction modes of the neighboring blocks of the            current block        -   g. Motion vectors of the neighboring blocks of the current            block        -   h. The indication of QR-BDPCM modes of the neighboring block            of the current block        -   i. Current quantization parameter of current block and/or            that of its neighboring blocks        -   j. Indication of the color format (such as 4:2:0, 4:4:4)        -   k. Separate/dual coding tree structure        -   l. Transform type applied to the current block        -   m. Slice/tile group type and/or picture type    -   7. In QR-BDPCM, the quantized residue are predicted along the        horizontal and vertical directions. It is proposed to predict        the quantized residue along the directions other than vertical        and horizontal directions. Suppose Q(r_(i,j)) denotes the        quantized residue {tilde over (r)}_(i,j) denotes the quantized        residue after the residue prediction process.        -   a. In one example, the 45-degree QR-BDPCM may be supported.            -   i. In one example, the DPCM may be performed along the                45-degree direction, where the {tilde over (r)}_(i,j)                may be derived by Q(r_(i,j))−Q(r_((i−1),(j−i))) if the                Q(r_((i−i),(j−i))) is available.        -   b. In one example, the 135-degree QR-BDPCM may be supported.            -   i. In one example, the DPCM may be performed along the                45-degree direction, where the {tilde over (r)}_(i,j)                may be derived by Q(r_(i,j))−Q(r_((i−1),(j+1))) if the                Q(r_((i−1),(j+1))) is available        -   c. In one example, any directions may be supported in            QR-BDPCM.            -   i. In one example, the {tilde over (r)}_(i,j) may be                derived by Q(r_(i,j))−Q(r_((i−m),(j−n))) if the                Q(r_((i−m),(j−n))) is available.                -   1. In one example, m and/or n may be signalled in                    the bitstream                -   2. In one example, m and/or n may be integer numbers                    and may be based on                -   3. A message signalled in the SPS/VPS/PPS/picture                    header/slice header/tile group header/LCU row/group                    of LCUs                -   4. i and/or j                -   5. Block dimension of current block and/or its                    neighboring blocks                -   6. Block shape of current block and/or its                    neighboring blocks                -   7. The most probable modes of the current block                    and/or its neighboring blocks                -   8. Prediction modes (Intra/Inter) of the neighboring                    blocks of the current block                -   9. Intra prediction modes of the neighboring blocks                    of the current block                -   10. Motion vectors of the neighboring blocks of the                    current block                -   11. The indication of QR-BDPCM modes of the                    neighboring block of the current block                -   12. Current quantization parameter of current block                    and/or that of its neighboring blocks                -   13. Indication of the color format (such as 4:2:0,                    4:4:4)                -   14. Separate/dual coding tree structure                -   15. Slice/tile group type and/or picture type    -   8. QR-BDPCM may be applied to chroma blocks (e.g., Cb/Cr, or B/R        color components).        -   a. In one example, the allowed intra prediction directions            for luma and chroma QR-BDPCM coded blocks may be the same,            e.g., only horizontal and vertical.        -   b. In one example, the allowed prediction methods for luma            and chroma QR-BDPCM coded blocks may be the same, e.g.,            IBC/Inter/horizontal and vertical intra prediction modes.        -   c. In one example, the allowed residual prediction direction            for luma and chroma QR-BDPCM coded blocks may be the same.        -   d. In one example, the residual prediction direction for            chroma QR-BDPCM may be derived from the residual prediction            direction for corresponding luma block.            -   i. In one example, the corresponding luma block may be                the collocated luma block.            -   ii. In one example, the corresponding luma block may be                the luma block containing the collocated sample of the                upper-left corner of the chroma block.            -   iii. In one example, the corresponding luma block may be                the luma block containing the collocated sample of the                centered sample of the chroma block.        -   e. In one example, CCLM and QR-BDPCM couldn't be applied to            the same chroma block.            -   i. Alternatively, CCLM may be also applicable to                QR-BDPCM coded blocks.        -   f. In one example, joint chroma residual coding (e.g., joint            cb and cr coding) method and QR-BDPCM couldn't be applied to            the same chroma block.    -   9. The reconstrued quantized residue in QR-BDPCM may be        restricted to be within a specific range.        -   a. In one example, a constraint may be added that all the            quantized residual differences (e.g., {tilde over (r)}_(i,j)            in equation 2-7-1 and 2-7-2) may be within a specific range.        -   b. In one example, a constraint may be added that all the            reconstrued quantized residual (e.g., Q(r_(i,j)) in equation            2-7-3 and 2-7-4) may be within a specific range.        -   c. In one example, clipping operation may be applied to the            quantized residual differences (e.g., {tilde over (r)}_(i,j)            in equation 2-7-1 and 2-7-2) so that the reconstrued            quantized residual may be within a specific range.        -   d. In one example, clipping operation may be applied to the            reconstrued quantized residual differences (e.g., Q(r_(i,j))            in equation 2-7-3 and 2-7-4) so that the reconstrued            quantized residual may be within a specific range.        -   e. In one example, the clipping operation may be defined as            (x<min? min: (x>max? max: x))        -   f. In one example, the clipping operation may be defined as            (x<=min? min: (x>=max? max: x))        -   g. In one example, the clipping operation may be defined as            (x<min? min: (x>=max? max: x))        -   h. In one example, the clipping operation may be defined as            (x<=min? min: (x>max? max: x))        -   i. In one example, the min and/or max may be negative or            positive        -   j. In one example, min is set to −32768 and max is set to            32767.            -   i. Alternatively, the min and/or max may depend on the                range of inverse quantization for blocks coded not with                QR-BDPCM.            -   ii. Alternatively, the min and/or max may depend on the                bit depth of input sample/reconstructed sample.            -   iii. Alternatively, the min and/or max may depend on                whether lossless coding is used.                -   1. In one example, the min and/or max may depend on                    transquant_bypass_enabled_flag.                -   2. In one example, the min and/or max may depend on                    cu_transquant_bypass_flag.        -   k. In one example, the min and/or max may be based on            -   i. A message signalled in the SPS/VPS/PPS/picture                header/slice header/tile group header/LCU row/group of                LCUs            -   ii. Block dimension of current block and/or its                neighboring blocks            -   iii. Block shape of current block and/or its neighboring                blocks            -   iv. The most probable modes of the current block and/or                its neighboring blocks            -   v. Prediction modes (Intra/Inter) of the neighboring                blocks of the current block            -   vi. Intra prediction modes of the neighboring blocks of                the current block            -   vii. Motion vectors of the neighboring blocks of the                current block            -   viii. The indication of QR-BDPCM modes of the                neighboring block of the current block            -   ix. Current quantization parameter of current block                and/or that of its neighboring blocks            -   x. Indication of the color format (such as 4:2:0, 4:4:4)            -   xi. Separate/dual coding tree structure            -   xii. Transform type applied to the current block            -   xiii. Slice/tile group type and/or picture type    -   10. QR-DPCM may be applied from the last row/column to the first        row/column for a block.        -   a. In one example, when the residual prediction direction is            horizontal, the (i+1)-th column's residual may be used to            predict the i-th column's residual.        -   b. In one example, when the residual prediction direction is            vertical, the (i+1)-th row's residual may be used to predict            the i-th row's residual.    -   11. QR-DPCM may be applied to a subset of a block.        -   a. In one example, when the residual prediction direction is            horizontal, QR-DPCM does not apply to the left most k            columns of residues.        -   b. In one example, when the residual prediction direction is            vertical, QR-DPCM does not apply to the upper most k rows of            residues.        -   c. In one example, when the residual prediction direction is            horizontal, QR-DPCM does not apply to the right most k            columns of residues.        -   d. In one example, when the residual prediction direction is            vertical, QR-DPCM does not apply to the bottom most k rows            of residues.        -   e. The value of k described above may be a predefined value,            based on.            -   i. A message signalled in the SPS/VPS/PPS/picture                header/slice header/tile group header/LCU row/group of                LCUs            -   ii. Block dimension of current block and/or its                neighboring blocks            -   iii. Block shape of current block and/or its neighboring                blocks            -   iv. The most probable modes of the current block and/or                its neighboring blocks            -   v. Prediction modes (Intra/Inter) of the neighboring                blocks of the current block            -   vi. Intra prediction modes of the current block            -   vii. Intra prediction modes of the neighboring blocks of                the current block            -   viii. Motion vectors of the neighboring blocks of the                current block            -   ix. The indication of QR-BDPCM modes of the neighboring                block of the current block            -   x. Current quantization parameter of current block                and/or that of its neighboring blocks            -   xi. Indication of the color format (such as 4:2:0,                4:4:4)            -   xii. Separate/dual coding tree structure            -   xiii. Transform type applied to the current block            -   xiv. Slice/tile group type and/or picture type    -   12. QR-DPCM may be applied segment by segment for a block        -   a. In one example, when the residual prediction direction is            vertical and N=nK, residual prediction may be performed as

${\overset{˜}{r}}_{i,j} = \left\{ {\begin{matrix}{{Q\left( r_{i,j} \right)},} & {{{i\mspace{14mu}\%\mspace{14mu} K} = 0},{0 \leq j \leq \left( {N - 1} \right)}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{{({i - 1})},j} \right)}},} & {{{i\mspace{14mu}\%\mspace{14mu} K} > 0},{i \leq \left( {M - 1} \right)},{0 \leq j \leq \left( {N - 1} \right)}}\end{matrix}.} \right.$

-   -   -   b. In one example, when the residual prediction direction is            horizontal and M=mK, residual prediction may be performed as

${\overset{˜}{r}}_{i,j} = \left\{ {\begin{matrix}{{Q\left( r_{i,j} \right)},} & {{0 \leq i \leq \left( {M - 1} \right)}\ ,{{j\mspace{14mu}\%\mspace{14mu} K} = 0}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{i,{({j - 1})}} \right)}},} & {{0 \leq i \leq \left( {M - 1} \right)}\ ,{{j\mspace{14mu}\%\mspace{14mu} K} > 0},{j \leq \left( {N - 1} \right)}}\end{matrix}.} \right.$

-   -   13. Enabling/disabling QR-DPCM for one color component may be        derived from that associated with another color component.        -   a. In one example, for a chroma block, whether to enable            QR-DPCM may be dependent on the usage of QR-DPCM associated            with one or multiple representative blocks within the            collocated luma block.            -   i. In one example, the representative block may be                defined in the same way as that used for DM derivation.            -   ii. In one example, if the representative block within                the collocated luma block is QR-DPCM coded, and the                current chroma block is coded with DM mode, QR-DPCM may                be also enabled for the current chroma block.        -   b. Alternatively, indication of usage of QR-DPCM may be            signaled for chroma components.            -   i. In one example, one flag may be signaled to indicate                the usage for two chroma components.            -   ii. Alternatively, two flags may be signaled to indicate                the usage for two chroma components, respectively.            -   iii. In one example, when the chroma block is coded with                certain modes (such as CCLM), the signaling of                indication of usage of QR-DPCM is skipped.    -   14. The above methods may be also applicable to other variances        of DPCM/QR-DPCM.

5. Embodiment

The changes on top of the draft provided by JVET-N0413 are highlightedin bold face italics. Deleted texts are marked with strikethrough.

5.1 Embodiment 1

i. Derivation Process for Luma Intra Prediction Mode

Input to this process are:

-   -   a luma location (xCb, yCb) specifying the top-left sample of the        current luma coding block relative to the top-left luma sample        of the current picture,    -   a variable cbWidth specifying the width of the current coding        block in luma samples,    -   a variable cbHeight specifying the height of the current coding        block in luma samples.        In this process, the luma intra prediction mode        IntraPredModeY[xCb][yCb] is derived.        Table 8-1 specifies the value for the intra prediction mode        IntraPredModeY[xCb][yCb] and the associated names.

TABLE 8-1 Specification of intra prediction mode and associated namesIntra prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2..66INTRA_ANGULAR2..INTRA_ANGULAR66 81..83 INTRA_LT_CCLM, INTRA_L_CCLM,INTRA_T_CCLM NOTE: The intra prediction modes INTRA_LT_CCLM,INTRA_L_CCLM and INTRA_T_CCLM are only applicable to chroma components.IntraPredModeY[xCb][yCb] is derived by the following ordered steps:

-   -   The neighbouring locations (xNbA, yNbA) and (xNbB, yNbB) are set        equal to (xCb−1, yCb+cbHeight−1) and (xCb+cbWidth−1, yCb−1),        respectively.    -   For X being replaced by either A or B, the variables        candIntraPredModeX are derived as follows:    -   . . .    -   The variables ispDefaultMode1 and ispDefaultMode2 are defined as        follows:    -   . . .    -   The candModeList[x] with x=0 . . . 5 is derived as follows:    -   . . .    -   IntraPredModeY[xCb][yCb] is derived by applying the following        procedure:        -   If bdpcm_flag[xCb][yCb] is equal to 1, the            IntraPredModeY[xCb][yCb] is set equal to            (bdpcm_dir_flag[xCb][yCb]==0?            INTRA_ANGULAR18:INTRA_ANGULAR50).        -   Otherwise if intra_luma_mpm_flag[xCb][yCb] is equal to 1,            the IntraPredModeY[xCb][yCb] is set equal to            candModeList[intra_luma_mpm_idx[xCb][yCb] ].        -   Otherwise, IntraPredModeY[xCb][yCb] is derived by applying            the following ordered steps:        -   . . .            The variable IntraPredModeY[x][y] with x=xCb . . .            xCb+cbWidth−1 and y=yCb . . . yCb+cbHeight−1 is set to be            equal to IntraPredModeY[xCb][yCb].

5.2 Embodiment 2

8.4.2 Derivation Process for Luma Intra Prediction Mode

Input to this process are:

-   -   a luma location (xCb, yCb) specifying the top-left sample of the        current luma coding block relative to the top-left luma sample        of the current picture,    -   a variable cbWidth specifying the width of the current coding        block in luma samples,    -   a variable cbHeight specifying the height of the current coding        block in luma samples.        In this process, the luma intra prediction mode        IntraPredModeY[xCb][yCb] is derived.        Table 8-1 specifies the value for the intra prediction mode        IntraPredModeY[xCb][yCb] and the associated names.

TABLE 8-1 Specification of intra prediction mode and associated namesIntra prediction mode Associated name 0 INTRA _PLANAR 1 INTRA _DC 2..66INTRA_ANGULAR2..INTRA_ANGULAR66 81..83 INTRA_LT_CCLM, INTRA_L_CCLM,INTRA_T_CCLM NOTE: The intra prediction modes INTRA_LT_CCLM,INTRA_L_CCLM and INTRA_T_CCLM are only applicable to chroma components.IntraPredModeY[xCb][yCb] is derived by the following ordered steps:

-   -   If bdpcm_flag[xCb][yCb] is equal to 1, the        IntraPredModeY[xCb][yCb] is set equal to        (bdpcm_dir_flag[xCb][yCb]==0? INTRA_ANGULAR18:INTRA_ANGULAR50).    -   Otherwise, IntraPredModeY[xCb][yCb] is derived by applying the        following ordered steps:        -   The neighbouring locations (xNbA, yNbA) and (xNbB, yNbB) are            set equal to (xCb−1, yCb+cbHeight−1) and (xCb+cbWidth−1,            yCb−1), respectively.        -   For X being replaced by either A or B, the variables            candIntraPredModeX are derived as follows:        -   . . .        -   The variables ispDefaultMode1 and ispDefaultMode2 are            defined as follows:        -   . . .        -   The candModeList[x] with x=0 . . . 5 is derived as follows:        -   . . .        -   IntraPredModeY[xCb][yCb] is derived by applying the            following procedure:            -   if intra_luma_mpm_flag[xCb][yCb] is equal to 1, the                IntraPredModeY[xCb][yCb] is set equal to                candModeList[intra_luma_mpm_idx[xCb][yCb] ].            -   Otherwise, IntraPredModeY[xCb][yCb] is derived by                applying the following ordered steps:            -   . . .

The variable IntraPredModeY[x][y] with x=xCb . . . xCb+cbWidth−1 andy=yCb . . . yCb+cbHeight−1 is set to be equal toIntraPredModeY[xCb][yCb].

6. Reference

-   [1] ITU-T and ISO/IEC, “High efficiency video coding”, Rec. ITU-T    H.265 I ISO/IEC 23008-2 (02/2018).-   [2] B. Bross, J. Chen, S. Liu, Versatile Video Coding (Draft 4),    JVET-M1001, January 2019

FIG. 10 is a block diagram of a video processing apparatus 1000. Theapparatus 1000 may be used to implement one or more of the methodsdescribed herein. The apparatus 1000 may be embodied in a smartphone,tablet, computer, Internet of Things (IoT) receiver, and so on. Theapparatus 1000 may include one or more processors 1002, one or morememories 1004 and video processing hardware 1006. The processor(s) 1002may be configured to implement one or more methods described in thepresent document. The memory (memories) 1004 may be used for storingdata and code used for implementing the methods and techniques describedherein. The video processing hardware 1006 may be used to implement, inhardware circuitry, some techniques described in the present document.

FIG. 11 is a flowchart for an example method 1100 of video processing.The method 1100 includes performing (1102) a conversion between acurrent video block and a bitstream representation of the current videoblock using a differential coding mode and selectively using an intraprediction mode based on a coexistence rule. The intra prediction modeis used for generating predictions for samples of the current videoblock. The differential coding mode is used to represent a quantizedresidual block from the predictions of the pixels, using a differentialpulse coding modulation representation.

FIG. 15 is a block diagram that illustrates an example video codingsystem 100 that may utilize the techniques of this disclosure. As shownin FIG. 15, video coding system 100 may include a source device 110 anda destination device 120. Source device 110 generates encoded video datawhich may be referred to as a video encoding device. Destination device120 may decode the encoded video data generated by source device 110which may be referred to as a video decoding device. Source device 110may include a video source 112, a video encoder 114, and an input/output(I/O) interface 116.

Video source 112 may include a source such as a video capture device, aninterface to receive video data from a video content provider, and/or acomputer graphics system for generating video data, or a combination ofsuch sources. The video data may comprise one or more pictures. Videoencoder 114 encodes the video data from video source 112 to generate abitstream. The bitstream may include a sequence of bits that form acoded representation of the video data. The bitstream may include codedpictures and associated data. The coded picture is a codedrepresentation of a picture. The associated data may include sequenceparameter sets, picture parameter sets, and other syntax structures. I/Ointerface 116 may include a modulator/demodulator (modem) and/or atransmitter. The encoded video data may be transmitted directly todestination device 120 via I/O interface 116 through network 130 a. Theencoded video data may also be stored onto a storage medium/server 130 bfor access by destination device 120.

Destination device 120 may include an I/O interface 126, a video decoder124, and a display device 122.

I/O interface 126 may include a receiver and/or a modem. I/O interface126 may acquire encoded video data from the source device 110 or thestorage medium/server 130 b. Video decoder 124 may decode the encodedvideo data. Display device 122 may display the decoded video data to auser. Display device 122 may be integrated with the destination device120, or may be external to destination device 120 which be configured tointerface with an external display device.

Video encoder 114 and video decoder 124 may operate according to a videocompression standard, such as the High Efficiency Video Coding (HEVC)standard, Versatile Video Coding (VVC) standard and other current and/orfurther standards.

FIG. 16 is a block diagram illustrating an example of video encoder 200,which may be video encoder 114 in the system 100 illustrated in FIG. 15.

Video encoder 200 may be configured to perform any or all of thetechniques of this disclosure. In the example of FIG. 16, video encoder200 includes a plurality of functional components. The techniquesdescribed in this disclosure may be shared among the various componentsof video encoder 200. In some examples, a processor may be configured toperform any or all of the techniques described in this disclosure.

The functional components of video encoder 200 may include a partitionunit 201, a predication unit 202 which may include a mode select unit203, a motion estimation unit 204, a motion compensation unit 205 and anintra prediction unit 206, a residual generation unit 207, a transformunit 208, a quantization unit 209, an inverse quantization unit 210, aninverse transform unit 211, a reconstruction unit 212, a buffer 213, andan entropy encoding unit 214.

In other examples, video encoder 200 may include more, fewer, ordifferent functional components. In an example, predication unit 202 mayinclude an intra block copy (IBC) unit. The IBC unit may performpredication in an IBC mode in which at least one reference picture is apicture where the current video block is located.

Furthermore, some components, such as motion estimation unit 204 andmotion compensation unit 205 may be highly integrated, but arerepresented in the example of FIG. 16 separately for purposes ofexplanation.

Partition unit 201 may partition a picture into one or more videoblocks. Video encoder 200 and video decoder 300 may support variousvideo block sizes.

Mode select unit 203 may select one of the coding modes, intra or inter,e.g., based on error results, and provide the resulting intra- orinter-coded block to a residual generation unit 207 to generate residualblock data and to a reconstruction unit 212 to reconstruct the encodedblock for use as a reference picture. In some example, Mode select unit203 may select a combination of intra and inter predication (CIIP) modein which the predication is based on an inter predication signal and anintra predication signal. Mode select unit 203 may also select aresolution for a motion vector (e.g., a sub-pixel or integer pixelprecision) for the block in the case of inter-predication.

To perform inter prediction on a current video block, motion estimationunit 204 may generate motion information for the current video block bycomparing one or more reference frames from buffer 213 to the currentvideo block. Motion compensation unit 205 may determine a predictedvideo block for the current video block based on the motion informationand decoded samples of pictures from buffer 213 other than the pictureassociated with the current video block.

Motion estimation unit 204 and motion compensation unit 205 may performdifferent operations for a current video block, for example, dependingon whether the current video block is in an I slice, a P slice, or a Bslice.

In some examples, motion estimation unit 204 may perform uni-directionalprediction for the current video block, and motion estimation unit 204may search reference pictures of list 0 or list 1 for a reference videoblock for the current video block. Motion estimation unit 204 may thengenerate a reference index that indicates the reference picture in list0 or list 1 that contains the reference video block and a motion vectorthat indicates a spatial displacement between the current video blockand the reference video block. Motion estimation unit 204 may output thereference index, a prediction direction indicator, and the motion vectoras the motion information of the current video block. Motioncompensation unit 205 may generate the predicted video block of thecurrent block based on the reference video block indicated by the motioninformation of the current video block.

In other examples, motion estimation unit 204 may perform bi-directionalprediction for the current video block, motion estimation unit 204 maysearch the reference pictures in list 0 for a reference video block forthe current video block and may also search the reference pictures inlist 1 for another reference video block for the current video block.Motion estimation unit 204 may then generate reference indexes thatindicate the reference pictures in list 0 and list 1 containing thereference video blocks and motion vectors that indicate spatialdisplacements between the reference video blocks and the current videoblock. Motion estimation unit 204 may output the reference indexes andthe motion vectors of the current video block as the motion informationof the current video block. Motion compensation unit 205 may generatethe predicted video block of the current video block based on thereference video blocks indicated by the motion information of thecurrent video block.

In some examples, motion estimation unit 204 may output a full set ofmotion information for decoding processing of a decoder.

In some examples, motion estimation unit 204 may do not output a fullset of motion information for the current video. Rather, motionestimation unit 204 may signal the motion information of the currentvideo block with reference to the motion information of another videoblock. For example, motion estimation unit 204 may determine that themotion information of the current video block is sufficiently similar tothe motion information of a neighboring video block.

In one example, motion estimation unit 204 may indicate, in a syntaxstructure associated with the current video block, a value thatindicates to the video decoder 300 that the current video block has thesame motion information as the another video block.

In another example, motion estimation unit 204 may identify, in a syntaxstructure associated with the current video block, another video blockand a motion vector difference (MVD). The motion vector differenceindicates a difference between the motion vector of the current videoblock and the motion vector of the indicated video block. The videodecoder 300 may use the motion vector of the indicated video block andthe motion vector difference to determine the motion vector of thecurrent video block.

As discussed above, video encoder 200 may predictively signal the motionvector. Two examples of predictive signaling techniques that may beimplemented by video encoder 200 include advanced motion vectorpredication (AMVP) and merge mode signaling.

Intra prediction unit 206 may perform intra prediction on the currentvideo block. When intra prediction unit 206 performs intra prediction onthe current video block, intra prediction unit 206 may generateprediction data for the current video block based on decoded samples ofother video blocks in the same picture. The prediction data for thecurrent video block may include a predicted video block and varioussyntax elements.

Residual generation unit 207 may generate residual data for the currentvideo block by subtracting (e.g., indicated by the minus sign) thepredicted video block(s) of the current video block from the currentvideo block. The residual data of the current video block may includeresidual video blocks that correspond to different sample components ofthe samples in the current video block.

In other examples, there may be no residual data for the current videoblock for the current video block, for example in a skip mode, andresidual generation unit 207 may not perform the subtracting operation.

Transform processing unit 208 may generate one or more transformcoefficient video blocks for the current video block by applying one ormore transforms to a residual video block associated with the currentvideo block.

After transform processing unit 208 generates a transform coefficientvideo block associated with the current video block, quantization unit209 may quantize the transform coefficient video block associated withthe current video block based on one or more quantization parameter (QP)values associated with the current video block.

Inverse quantization unit 210 and inverse transform unit 211 may applyinverse quantization and inverse transforms to the transform coefficientvideo block, respectively, to reconstruct a residual video block fromthe transform coefficient video block. Reconstruction unit 212 may addthe reconstructed residual video block to corresponding samples from oneor more predicted video blocks generated by the predication unit 202 toproduce a reconstructed video block associated with the current blockfor storage in the buffer 213.

After reconstruction unit 212 reconstructs the video block, loopfiltering operation may be performed reduce video blocking artifacts inthe video block.

Entropy encoding unit 214 may receive data from other functionalcomponents of the video encoder 200. When entropy encoding unit 214receives the data, entropy encoding unit 214 may perform one or moreentropy encoding operations to generate entropy encoded data and outputa bitstream that includes the entropy encoded data.

FIG. 17 is a block diagram illustrating an example of video decoder 300which may be video decoder 114 in the system 100 illustrated in FIG. 15.

The video decoder 300 may be configured to perform any or all of thetechniques of this disclosure. In the example of FIG. 17, the videodecoder 300 includes a plurality of functional components. Thetechniques described in this disclosure may be shared among the variouscomponents of the video decoder 300. In some examples, a processor maybe configured to perform any or all of the techniques described in thisdisclosure.

In the example of FIG. 17, video decoder 300 includes an entropydecoding unit 301, a motion compensation unit 302, an intra predictionunit 303, an inverse quantization unit 304, an inverse transformationunit 305, and a reconstruction unit 306 and a buffer 307. Video decoder300 may, in some examples, perform a decoding pass generally reciprocalto the encoding pass described with respect to video encoder 200 (FIG.16).

Entropy decoding unit 301 may retrieve an encoded bitstream. The encodedbitstream may include entropy coded video data (e.g., encoded blocks ofvideo data). Entropy decoding unit 301 may decode the entropy codedvideo data, and from the entropy decoded video data, motion compensationunit 302 may determine motion information including motion vectors,motion vector precision, reference picture list indexes, and othermotion information. Motion compensation unit 302 may, for example,determine such information by performing the AMVP and merge mode.

Motion compensation unit 302 may produce motion compensated blocks,possibly performing interpolation based on interpolation filters.Identifiers for interpolation filters to be used with sub-pixelprecision may be included in the syntax elements.

Motion compensation unit 302 may use interpolation filters as used byvideo encoder 20 during encoding of the video block to calculateinterpolated values for sub-integer pixels of a reference block. Motioncompensation unit 302 may determine the interpolation filters used byvideo encoder 200 according to received syntax information and use theinterpolation filters to produce predictive blocks.

Motion compensation unit 302 may uses some of the syntax information todetermine sizes of blocks used to encode frame(s) and/or slice(s) of theencoded video sequence, partition information that describes how eachmacroblock of a picture of the encoded video sequence is partitioned,modes indicating how each partition is encoded, one or more referenceframes (and reference frame lists) for each inter-encoded block, andother information to decode the encoded video sequence.

Intra prediction unit 303 may use intra prediction modes for examplereceived in the bitstream to form a prediction block from spatiallyadjacent blocks. Inverse quantization unit 303 inverse quantizes, i.e.,de-quantizes, the quantized video block coefficients provided in thebitstream and decoded by entropy decoding unit 301. Inverse transformunit 303 applies an inverse transform.

Reconstruction unit 306 may sum the residual blocks with thecorresponding prediction blocks generated by motion compensation unit202 or intra-prediction unit 303 to form decoded blocks. If desired, adeblocking filter may also be applied to filter the decoded blocks inorder to remove blockiness artifacts. The decoded video blocks are thenstored in buffer 307, which provides reference blocks for subsequentmotion compensation/intra predication and also produces decoded videofor presentation on a display device.

In some embodiments, in the ALWIP mode or MIP mode, a prediction blockfor the current video block is determined by a row and column wiseaveraging, followed by a matrix multiplication, followed by aninterpolation to determine the prediction block.

FIG. 18 is a block diagram showing an example video processing system2100 in which various techniques disclosed herein may be implemented.Various implementations may include some or all of the components of thesystem 2100. The system 2100 may include input 2102 for receiving videocontent. The video content may be received in a raw or uncompressedformat, e.g., 8 or 10 bit multi-component pixel values, or may be in acompressed or encoded format. The input 2102 may represent a networkinterface, a peripheral bus interface, or a storage interface. Examplesof network interface include wired interfaces such as Ethernet, passiveoptical network (PON), etc. and wireless interfaces such as Wi-Fi orcellular interfaces.

The system 2100 may include a coding component 2104 that may implementthe various coding or encoding methods described in the presentdocument. The coding component 2104 may reduce the average bitrate ofvideo from the input 2102 to the output of the coding component 2104 toproduce a coded representation of the video. The coding techniques aretherefore sometimes called video compression or video transcodingtechniques. The output of the coding component 2104 may be eitherstored, or transmitted via a communication connected, as represented bythe component 2106. The stored or communicated bitstream (or coded)representation of the video received at the input 2102 may be used bythe component 2108 for generating pixel values or displayable video thatis sent to a display interface 2110. The process of generatinguser-viewable video from the bitstream representation is sometimescalled video decompression. Furthermore, while certain video processingoperations are referred to as “coding” operations or tools, it will beappreciated that the coding tools or operations are used at an encoderand corresponding decoding tools or operations that reverse the resultsof the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface mayinclude universal serial bus (USB) or high definition multimediainterface (HDMI) or Displayport, and so on. Examples of storageinterfaces include SATA (serial advanced technology attachment), PCI,IDE interface, and the like. The techniques described in the presentdocument may be embodied in various electronic devices such as mobilephones, laptops, smartphones or other devices that are capable ofperforming digital data processing and/or video display.

Some embodiments of the disclosed technology include making a decisionor determination to enable a video processing tool or mode. In anexample, when the video processing tool or mode is enabled, the encoderwill use or implement the tool or mode in the processing of a block ofvideo, but may not necessarily modify the resulting bitstream based onthe usage of the tool or mode. That is, a conversion from the block ofvideo to the bitstream representation of the video will use the videoprocessing tool or mode when it is enabled based on the decision ordetermination. In another example, when the video processing tool ormode is enabled, the decoder will process the bitstream with theknowledge that the bitstream has been modified based on the videoprocessing tool or mode. That is, a conversion from the bitstreamrepresentation of the video to the block of video will be performedusing the video processing tool or mode that was enabled based on thedecision or determination.

Some embodiments of the disclosed technology include making a decisionor determination to disable a video processing tool or mode. In anexample, when the video processing tool or mode is disabled, the encoderwill not use the tool or mode in the conversion of the block of video tothe bitstream representation of the video. In another example, when thevideo processing tool or mode is disabled, the decoder will process thebitstream with the knowledge that the bitstream has not been modifiedusing the video processing tool or mode that was disabled based on thedecision or determination.

FIG. 19 shows a flowchart for an example video processing method 1900.The method 1900 includes performing 1902 a conversion between a currentvideo block of a video and a bitstream representation of the currentvideo block by determining a first intra coding mode to be stored whichis associated with the current video block using a differential codingmode, where the first intra coding mode associated with the currentvideo block is determined according to a second prediction mode used bythe differential coding mode, and where, in the differential codingmode, a difference between a quantized residual of an intra predictionof the current video block and a prediction of the quantized residual isrepresented in the bitstream representation for the current video blockusing a differential pulse coding modulation (DPCM) representation.

In some embodiments for method 1900, the first intra coding mode isinferred to a vertical intra prediction mode in response to the secondprediction mode being a vertical prediction mode. In some embodimentsfor method 1900, the first intra coding mode is inferred to a horizontalintra prediction mode in response to the second prediction mode being ahorizontal prediction mode. In some embodiments for method 1900, thefirst intra coding mode is inferred to a top-left diagonal intraprediction mode in response to the second prediction mode being atop-left diagonal prediction mode. In some embodiments for method 1900,the first intra coding mode is inferred to be same as the secondprediction mode.

In some embodiments for method 1900, the second prediction mode isinferred to be same as the first intra coding mode. In some embodimentsfor method 1900, the first intra coding mode is inferred based on a modein a most probable modes (MPM) list. In some embodiments for method1900, the first intra coding mode is a pre-defined intra predictionmode. In some embodiments for method 1900, the pre-defined intraprediction mode includes a Planar mode. In some embodiments for method1900, the pre-defined intra prediction mode includes a DC mode. In someembodiments for method 1900, the pre-defined intra prediction modeincludes a vertical mode. In some embodiments for method 1900, thepre-defined intra prediction mode includes a horizontal mode. In someembodiments for method 1900, additional video blocks of the video arecoded with the first intra coding mode, and wherein the current videoblock precedes in time the additional video blocks. In some embodimentsfor method 1900, a most probable modes (MPM) list is constructed for theadditional video blocks using the first intra coding mode.

FIG. 20 shows a flowchart for an example video processing method 2000.The method 2000 includes determining 2002, according to a rule, an intracoding mode used by a differential coding mode during a conversionbetween a current video block of a video and a bitstream representationof the current video block. Operation 2004 includes performing, based onthe determining, the conversion between the current video block and thebitstream representation of the current video block using thedifferential coding mode, where, in the differential coding mode, adifference between a quantized residual of an intra prediction of thecurrent video block and a prediction of the quantized residual isrepresented in the bitstream representation for the current video blockusing a differential pulse coding modulation (DPCM) representation, andwhere the prediction of the quantized residual is performed according tothe intra coding mode.

In some embodiments for method 2000, the rule specifies that the intracoding mode is determined based on a color component associated with thecurrent video block. In some embodiments for method 2000, the rulespecifies that the intra coding mode is determined based on a messagesignaled in: a sequence parameter set (SPS), a video parameter set(VPS), a picture parameter set (PPS), a picture header, a slice header,a tile group header, a largest coding unit (LCU) row, or a group ofLCUs. In some embodiments for method 2000, the rule specifies that theintra coding mode is determined based on a flag that indicates adirection in which the intra coding mode is performed in thedifferential coding mode. In some embodiments for method 2000, the rulespecifies that the intra coding mode is determined based on a flag thatindicates a direction of the prediction of the quantized residual. Insome embodiments for method 2000, the rule specifies that the intracoding mode is determined based on a block dimension of either thecurrent video block or a neighboring video block of the current videoblock.

In some embodiments for method 2000, the rule specifies that the intracoding mode is determined based on a shape of either the current videoblock or a neighboring video block of the current video block. In someembodiments for method 2000, the rule specifies that the intra codingmode is determined based on most probable modes (MPM) of the currentvideo block or of a neighboring video block of the current video block.In some embodiments for method 2000, the rule specifies that the intracoding mode is determined based on an inter prediction mode or an intraprediction mode of a neighboring video block of the current video block.In some embodiments for method 2000, the rule specifies that the intracoding mode is determined based on motion vectors of a neighboring videoblock of the current video block. In some embodiments for method 2000,the rule specifies that the intra coding mode is determined based on anindication of whether a neighboring video block of the current videoblock is coded using the differential coding mode.

In some embodiments for method 2000, the rule specifies that the intracoding mode is determined based on a value of a quantization parameterof the current video block or of a neighboring video block of thecurrent video block. In some embodiments for method 2000, the rulespecifies that the intra coding mode is determined based on a colorformat used for coding the current video block. In some embodiments formethod 2000, the rule specifies that the intra coding mode is determinedbased on whether a separate or a dual coding tree structure is used forcoding the current video block. In some embodiments for method 2000, therule specifies that the intra coding mode is determined based on atransform type applied to the current video block. In some embodimentsfor method 2000, the rule specifies that the intra coding mode isdetermined based on a slice or a tile group type or a picture typeassociated with the current video block.

The following listing of examples is a description of additionalembodiments.

1. A method of video processing, comprising: performing a conversionbetween a current video block and a bitstream representation of thecurrent video block using a differential coding mode and selectivelyusing an intra prediction mode based on a coexistence rule; wherein theintra prediction mode is used for generating predictions for samples ofthe current video block; and wherein, the differential coding mode isused to represent a quantized residual block from the predictions of thepixels, using a differential pulse coding modulation representation.

2. The method of example 1, wherein the intra prediction mode is amatrix based intra prediction mode (MIP), and wherein the coexistencerule restricts the MIP to a partial of allowed modes of the MIP.

3. The method of example 2, wherein the partial of allowed modes includehorizontal or vertical normal intra modes.

Further embodiments of examples 1-3 are described in item 1, section 4.For example, the differential coding mode may represent the currentversion of the QR-BDPCM coding mode.

4. The method of example 1, wherein the intra prediction mode includes aprediction along a non-horizontal or a non-vertical direction.

5. The method of example 1 or 4, wherein the intra prediction mode is aplanar or a DC prediction mode.

6. The method of example 1 or 4, wherein the intra prediction modes is avertical or a horizontal prediction mode.

7. The method of example 1 or 4, wherein the intra prediction mode isidentified by a field in the bitstream representation.

8. The method of example 1 or 4, wherein the intra prediction mode isdependent on a block dimension of the current video block or aneighboring block.

9. The method of example 1 or 4, wherein the intra prediction mode isdependent on a shape of the current block or a neighboring block.

10. The method of example 1 or 4, wherein the intra prediction mode isdependent on whether the current video block or the neighboring videoblock is coded using inter prediction or intra prediction.

11. The method of example 1 or 4, wherein the intra prediction mode isdependent on whether the neighboring video block is coded using thedifferential coding mode.

12. The method of example 1 or 4, wherein the intra prediction mode isdependent on value of a quantization parameter used for the currentvideo block or the neighboring video block.

13. The method of example 1 or 4, wherein the intra prediction mode isdependent on a color format used for coding the current video block.

14. The method of example 1 or 4, wherein the intra prediction mode isdependent on whether a separate or a dual coding tree structure is usedfor coding the current video block.

Further embodiments of examples 4 to 14 are provided in item 2 ofsection 4.

15. The method of example 1, wherein the generating predictions forsamples of the current video block is performed from non-adjacentsamples in a neighboring video region.

16. The method of example 1, wherein the intra prediction mode comprisesan intra block copy merge mode.

17. The method of example 1, wherein the intra prediction mode comprisesan intra block copy advanced motion vector prediction mode.

18. The method of any of examples 15 to 17, wherein the intra predictionmode is indicated by a block vector or a merge index.

Further embodiments of examples 15 to 18 are provided in item 3 ofsection 4.

19. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a field in the bitstream representation.

20. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a dimension of the current video block ora neighboring block.

21. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a shape of the current video block or aneighboring block.

22. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a prediction mode of the current videoblock or a neighboring block.

23. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on most probable modes of the current videoblock or a neighboring block.

24. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on motion vectors of the current video blockor a neighboring block.

25. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on whether or not a neighboring block iscoded using the differential coding mode.

26. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a quantization parameter used by thecurrent video block or a neighboring block.

27. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a color format of the current videoblock.

28. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on whether a separate or a dual coding treeis used by the current video block.

29. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a transform applied to the current videoblock.

30. The method of example 1, wherein the coexistence rule specifies amapping from a signaled index in the differential coding mode to theintra prediction mode based on a slice type or a tile group type or apicture type of the current video block.

Further embodiments of examples 19 to 30 are provided in item 2 ofsection 4.

31. A method of video processing, comprising: performing a conversionbetween a current video block and a bitstream representation of thecurrent video block using a differential coding mode in which aquantized residual block from a predictions of pixels of the currentvideo block is represented using a differential pulse coding modulationrepresentation; wherein a first direction of the prediction or a seconddirection of the differential coding mode is inferable from thebitstream representation.

32. The method of example 31, wherein the first direction of theprediction of pixels is implicitly inferable from an intra predictionmode used for the predicting.

33. The method of example 32, wherein the second direction of thedifferential coding mode is inferable to be a same direction as thefirst direction of the prediction.

34. The method of example 31, wherein the second direction is inferablefrom an intra prediction mode used for the predicting.

35. The method of example 31, wherein the second direction is inferablefrom a dimension of the current video block or a neighboring block or ashape of the current video block or a neighboring block.

36. The method of example 31, wherein the second direction is inferablefrom motion vectors of a neighboring block.

37. The method of example 31, wherein the second direction is inferablefrom most probable modes of the current video block or a neighboringblock.

38. The method of example 31, wherein the second direction is inferablefrom a prediction mode of a neighboring block.

39. The method of example 31, wherein the second direction is inferablefrom an intra prediction mode of a neighboring block.

40. The method of example 31, wherein the second direction is inferablefrom whether or not a neighboring block uses the differential codingmode.

Further embodiments of examples 31-40 are provided in item 4 of section4.

41. A method of video processing, comprising: determining, based on anapplicability rule, that a differential coding mode is applicable to aconversion between a current video block and a bitstream representationof the current video block; and performing the conversion between acurrent video block and a bitstream representation using thedifferential coding mode; wherein, in the differential coding mode, aquantized residual block from intra prediction of pixels of the currentvideo block is represented using a differential pulse coding modulationrepresentation performed in a residual prediction direction that isdifferent from a horizontal or a vertical direction.

42. The method of example 41, wherein the residual prediction directionis a 45-degree direction.

43. The method of example 41, wherein the residual prediction directionis a 135-degree direction.

44. The method of example 41, wherein the residual prediction directionis related to a field in the bitstream representation or a dimension ofthe current video block or a neighboring block or a shape of the currentvideo block or the neighboring block.

Further embodiments of examples 41 to 44 are provided in item 7 ofsection 4.

45. The method of example 41, wherein the applicability rule specifiesto use the differential coding mode due to the current video block beinga chroma block.

46. The method of example 45, wherein the applicability rule furtherspecifies to that the residual prediction direction for the currentvideo block is a same direction as that for a luma block correspondingto the current video block.

47. The method of example 41, wherein the applicability rule specifiesto use the differential coding due to the current video block not usinga cross-component linear model (CCLM) coding mode.

Further embodiments of examples 45 to 47 are provided in item 8 ofsection 4.

48. The method of example 41, wherein the applicability rule specifiesto derive applicability of the differential coding mode for one colorcomponent from applicability of the differential coding mode for anothercolor component.

Further embodiments of example 48 are provided in item 12 of section 4.

49. A method of video processing, comprising: determining that adifferential coding mode is applicable to a conversion between a currentvideo block and a bitstream representation of the current video block;and performing the conversion between a current video block and abitstream representation using an implementation rule of thedifferential coding mode; wherein, in the differential coding mode, aquantized residual block from intra prediction of pixels of the currentvideo block is represented using a differential pulse coding modulationrepresentation performed in a residual prediction direction that isdifferent from a horizontal or a vertical direction.

50. The method of example 49, wherein the implementation rule specifiesto restrict values of the quantized residual block within a range.

51. The method of example 49, wherein the implementation rule specifiesusing clipping to obtain the quantized residual block.

Further embodiments of examples 49-51 are provided in item 9 of section4.

52. The method of example 49, wherein the implementation rule specifiesto perform prediction from a last row of the current video block to afirst row of the current video block.

53. The method of example 49, wherein the implementation rule specifiesto perform prediction from a last column of the current video block to afirst column of the current video block.

Further embodiments of examples 52 to 53 are provided in item 10 ofsection 4.

54. The method of example 49, wherein the implementation rule specifiesto apply the differential coding mode to only a subset of the currentvideo block.

55. The method of example 54, wherein the subset excludes k left columnsof residues, where k is an integer smaller than a pixel width of theblock.

56. The method of example 54, wherein the subset excludes k top rows ofresidues, where k is an integer smaller than a pixel height of theblock.

Further embodiments of examples 54 to 56 are provided in item 10 ofsection 4.

57. The method of example 49, wherein the implementation rule specifiesto apply the differential coding mode on a segment by segment basis tothe conversion.

Further embodiments of example 57 are provided in item 12 of section 4.

58. A method of video processing, comprising: determining that adifferential coding mode used during a conversion between a currentvideo block and a bitstream representation of the current video block issame as an intra coding mode associated with the current video block;and performing the conversion between a current video block and abitstream representation using an implementation rule of thedifferential coding mode; wherein, in the differential coding mode, aquantized residual block from intra prediction of pixels of the currentvideo block is represented using a differential pulse coding modulationrepresentation performed in a residual prediction direction that isdifferent from a horizontal or a vertical direction.

59. The method of example 58, wherein the differential coding mode is avertical intra prediction mode.

60. The method of example 58, wherein the differential coding mode is ahorizontal intra prediction mode.

61. The method of example 58, wherein the differential coding mode is apredefined intra prediction mode.

Further embodiments for examples 58-61 are described in item 5 ofsection 4.

62. A video processing apparatus comprising a processor configured toimplement one or more of examples 1 to 61.

63. A computer-readable medium having code stored thereon, the code,when executed by a processor, causing the processor to implement amethod recited in any one or more of examples 1 to 61.

In the listing of examples in this present document, the term conversionmay refer to the generation of the bitstream representation for thecurrent video block or generating the current video block from thebitstream representation. The bitstream representation need notrepresent a contiguous group of bits and may be divided into bits thatare included in header fields or in codewords representing coded pixelvalue information.

In the examples above, the applicability rule may be pre-defined andknown to encoders and decoders.

It will be appreciated that the disclosed techniques may be embodied invideo encoders or decoders to improve compression efficiency usingtechniques that include the use of various implementation rules ofconsiderations regarding the use of a differential coding mode in intracoding, as described in the present document.

The disclosed and other solutions, examples, embodiments, modules andthe functional operations described in this document can be implementedin digital electronic circuitry, or in computer software, firmware, orhardware, including the structures disclosed in this document and theirstructural equivalents, or in combinations of one or more of them. Thedisclosed and other embodiments can be implemented as one or morecomputer program products, i.e., one or more modules of computer programinstructions encoded on a computer readable medium for execution by, orto control the operation of, data processing apparatus. The computerreadable medium can be a machine-readable storage device, amachine-readable storage substrate, a memory device, a composition ofmatter effecting a machine-readable propagated signal, or a combinationof one or more them. The term “data processing apparatus” encompassesall apparatus, devices, and machines for processing data, including byway of example a programmable processor, a computer, or multipleprocessors or computers. The apparatus can include, in addition tohardware, code that creates an execution environment for the computerprogram in question, e.g., code that constitutes processor firmware, aprotocol stack, a database management system, an operating system, or acombination of one or more of them. A propagated signal is anartificially generated signal, e.g., a machine-generated electrical,optical, or electromagnetic signal, that is generated to encodeinformation for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, softwareapplication, script, or code) can be written in any form of programminglanguage, including compiled or interpreted languages, and it can bedeployed in any form, including as a stand-alone program or as a module,component, subroutine, or other unit suitable for use in a computingenvironment. A computer program does not necessarily correspond to afile in a file system. A program can be stored in a portion of a filethat holds other programs or data (e.g., one or more scripts stored in amarkup language document), in a single file dedicated to the program inquestion, or in multiple coordinated files (e.g., files that store oneor more modules, sub programs, or portions of code). A computer programcan be deployed to be executed on one computer or on multiple computersthat are located at one site or distributed across multiple sites andinterconnected by a communication network.

The processes and logic flows described in this document can beperformed by one or more programmable processors executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Processors suitable for the execution of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read only memory ora random-access memory or both. The essential elements of a computer area processor for performing instructions and one or more memory devicesfor storing instructions and data. Generally, a computer will alsoinclude, or be operatively coupled to receive data from or transfer datato, or both, one or more mass storage devices for storing data, e.g.,magnetic, magneto optical disks, or optical disks. However, a computerneed not have such devices. Computer readable media suitable for storingcomputer program instructions and data include all forms of non-volatilememory, media and memory devices, including by way of examplesemiconductor memory devices, e.g., EPROM, EEPROM, and flash memorydevices; magnetic disks, e.g., internal hard disks or removable disks;magneto optical disks; and CD ROM and DVD-ROM disks. The processor andthe memory can be supplemented by, or incorporated in, special purposelogic circuitry.

While this patent document contains many specifics, these should not beconstrued as limitations on the scope of any subject matter or of whatmay be claimed, but rather as descriptions of features that may bespecific to particular embodiments of particular techniques. Certainfeatures that are described in this patent document in the context ofseparate embodiments can also be implemented in combination in a singleembodiment. Conversely, various features that are described in thecontext of a single embodiment can also be implemented in multipleembodiments separately or in any suitable subcombination. Moreover,although features may be described above as acting in certaincombinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from thecombination, and the claimed combination may be directed to asubcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. Moreover, the separation of various system components in theembodiments described in this patent document should not be understoodas requiring such separation in all embodiments.

Only a few implementations and examples are described and otherimplementations, enhancements and variations can be made based on whatis described and illustrated in this patent document.

1. A method of processing video data, comprising: determining that adifferential coding mode is applied to a first video block of a video,and in the differential coding mode, a difference between a quantizedresiduals derived with a first intra prediction mode of the first videoblock and a prediction of the quantized residual is included in abitstream of the video; storing, aligned with a prediction directionused in the differential coding mode for the first video block, thefirst intra prediction mode of the first video block; constructing,based on the stored first intra prediction mode of the first videoblock, a mode candidate list for a second video block of the video,wherein the first video block is a spatial neighboring block of thesecond video block and the second video block is an intra block;determining, based on the mode candidate list, a second intra predictionmode for the current video block; and performing, based on the secondintra prediction mode, a conversion between the second video block andthe bitstream of the video.
 2. The method of claim 1, wherein the firstintra prediction mode is inferred to a vertical intra prediction mode inresponse to the prediction direction used in the differential codingmode for the first video block being vertical direction.
 3. The methodof claim 1, wherein the first intra prediction mode is inferred to ahorizontal intra prediction mode in response to the prediction directionused in the differential coding mode for the first video block beinghorizontal direction.
 4. The method of claim 1, wherein the predictiondirection of the differential coding mode for the first video block isdetermined based on a first syntax element included in the bitstreamindicating whether the prediction direction is horizontal or verticaldirection.
 5. The method of claim 1, wherein the first video block is aleft or above neighboring block of the second video block.
 6. The methodof claim 1, wherein when the first video block is not available, acandidate in the mode candidate list corresponding to the first videoblock is set to a planar intra prediction mode.
 7. The method of claim1, wherein the second intra prediction mode is determined based on asecond syntax element in the bitstream, wherein the second syntaxelement indicates an index of a candidate in the mode candidate listwhich is used for an intra prediction of the second video block.
 8. Themethod of claim 1, wherein a cross-component linear model coding mode isnot applied to the first video block in response to the differentialcoding mode being applied to the first video block.
 9. The method ofclaim 1, wherein the first video block is a luma block, and a thirdsyntax element is further used to indicate whether the differentialcoding mode is applied to a chroma components or not.
 10. The method ofclaim 1, wherein the difference is represented using a differentialpulse coding modulation representation.
 11. The method of claim 1,wherein the conversion includes encoding the second video block into thebitstream.
 12. The method of claim 1, wherein the conversion includesdecoding the second video block from the bitstream.
 13. An apparatus forprocessing video data comprising a processor and a non-transitory memorywith instructions thereon, wherein the instructions upon execution bythe processor, cause the processor to: determine that a differentialcoding mode is applied to a first video block of a video, and in thedifferential coding mode, a difference between a quantized derived witha first intra prediction mode of the first video block and a predictionof the quantized residual is included in a bitstream of the video;store, aligned with a prediction direction used in the differentialcoding mode for the first video block, the first intra prediction modeof the first video block; construct, based on the stored first intraprediction mode of the first video block, a mode candidate list for asecond video block of the video, wherein the first video block is aspatial neighboring block of the second video block and the second videoblock is an intra block; determine, based on the mode candidate list, asecond intra prediction mode for the current video block; and perform,based on the second intra prediction mode, a conversion between thesecond video block and the bitstream of the video.
 14. The apparatus ofclaim 13, wherein the first intra prediction mode is inferred to avertical intra prediction mode in response to the prediction directionused in the differential coding mode for the first video block beingvertical direction, or the first intra prediction mode is inferred to ahorizontal intra prediction mode in response to the prediction directionused in the differential coding mode for the first video block beinghorizontal direction, and wherein the prediction direction of thedifferential coding mode for the first video block is determined basedon a first syntax element included in the bitstream indicating whetherthe prediction direction is horizontal or vertical direction.
 15. Theapparatus of claim 13, wherein the first video block is a left or aboveneighboring block of the second video block, and when the first videoblock is not available, a candidate in the mode candidate listcorresponding to the first video block is set to a planar intraprediction mode.
 16. The apparatus of claim 13, wherein the second intraprediction mode is determined based on a second syntax element in thebitstream, wherein the second syntax element indicates an index of acandidate in the mode candidate list which is used for an intraprediction of the second video block.
 17. A non-transitorycomputer-readable storage medium storing instructions that cause aprocessor to: determine that a differential coding mode is applied to afirst video block of a video, and in the differential coding mode, adifference between a quantized derived with a first intra predictionmode of the first video block and a prediction of the quantized residualis included in a bitstream of the video; store, aligned with aprediction direction used in the differential coding mode for the firstvideo block, the first intra prediction mode of the first video block;construct, based on the stored first intra prediction mode of the firstvideo block, a mode candidate list for a second video block of thevideo, wherein the first video block is a spatial neighboring block ofthe second video block and the second video block is an intra block;determine, based on the mode candidate list, a second intra predictionmode for the current video block; and perform, based on the second intraprediction mode, a conversion between the second video block and thebitstream of the video.
 18. The non-transitory computer-readable storagemedium of claim 17, wherein the first intra prediction mode is inferredto a vertical intra prediction mode in response to the predictiondirection used in the differential coding mode for the first video blockbeing vertical direction, or the first intra prediction mode is inferredto a horizontal intra prediction mode in response to the predictiondirection used in the differential coding mode for the first video blockbeing horizontal direction, and wherein the prediction direction of thedifferential coding mode for the first video block is determined basedon a first syntax element included in the bitstream indicating whetherthe prediction direction is horizontal or vertical direction.
 19. Anon-transitory computer-readable recording medium storing a bitstream ofa video which is generated by a method performed by a video processingapparatus, wherein the method comprises: determining that a differentialcoding mode is applied to a first video block of a video, and in thedifferential coding mode, a difference between a quantized derived witha first intra prediction mode of the first video block and a predictionof the quantized residual is included in a bitstream of the video;storing, aligned with a prediction direction used in the differentialcoding mode for the first video block, the first intra prediction modeof the first video block; constructing, based on the stored first intraprediction mode of the first video block, a mode candidate list for asecond video block of the video, wherein the first video block is aspatial neighboring block of the second video block and the second videoblock is an intra block; determining, based on the mode candidate list,a second intra prediction mode for the current video block; andgenerating the bitstream based on the second intra prediction mode. 20.The non-transitory computer-readable storage medium of claim 19, whereinthe first intra prediction mode is inferred to a vertical intraprediction mode in response to the prediction direction used in thedifferential coding mode for the first video block being verticaldirection, or the first intra prediction mode is inferred to ahorizontal intra prediction mode in response to the prediction directionused in the differential coding mode for the first video block beinghorizontal direction, and wherein the prediction direction of thedifferential coding mode for the first video block is determined basedon a first syntax element included in the bitstream indicating whetherthe prediction direction is horizontal or vertical direction.